scientific article; zbMATH DE number 3492141

MaRDI QIDQ4074367zbMATH OpenFDO

Authors Erwin Engeler

Publication date 1975

Mathematics Subject Classification ID

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

Cited in

(11)

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

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)