scientific article; zbMATH DE number 1163990
From MaRDI portal
Publication:4395617
zbMath0903.03020MaRDI QIDQ4395617
Publication date: 14 December 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FLRcompletenessrecursiondecidabilitydenotational semanticslogic of programsequational proof systemleast-fixed-point interpretations
Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (4)
Computable execution traces ⋮ Recursion and corecursion have the same equational logic ⋮ From Mathesis Universalis to Provability, Computability, and Constructivity ⋮ Fixpoint semantics and simulation
This page was built for publication: