scientific article; zbMATH DE number 3492141

MaRDI QIDQ4074367zbMATH OpenFDO

Authors Erwin Engeler

Publication date 1975

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Applications of computability and recursion theory (03D80) Algorithms in computer science (68W99)

Cited in

(11)

• Computing with infinite objects
• The axiomatics of ordered geometry: I. Ordered incidence spaces
• Axiomatizing geometric constructions
• Definability in dynamic logic
• Semantics of algorithmic languages
• Stratified least fixpoint logic
• The unwind property for programs with bounded memory
• Necessary and sufficient conditions for the universality of programming formalisms
• Floyd's principle, correctness theories and program equivalence
• Equivalences among logics of programs
• Definability by programs in first-order structures

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074367)