scientific article; zbMATH DE number 3637823

zbMath0411.03017MaRDI QIDQ4198727

Ildikó Sain, Istvan Németi, Hajnalka Andréka

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

completenessdynamic logicabstract model theorynon-classical modelsnonstandard model theorylogic of actionslogic for reasoning about programsHenkin-type semanticsprogramverification

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01) Nonclassical models (Boolean-valued, sheaf, etc.) (03C90) Algorithms in computer science (68W99) Abstract model theory (03C95)

Related Items

Non-standard algorithmic and dynamic logic, Changing a Semantics: Opportunism or Courage?, Undecidability of QLTL and QCTL with two variables and one monadic predicate letter, Recursive programs and denotational semantics in absolute logics of programs, Some general incompleteness results for partial correctness logics, A survey on temporal logics for specifying and verifying real-time systems, A complete logic for reasoning about programs via nonstandard model theory. I, A complete logic for reasoning about programs via nonstandard model theory. II, Concrete categories and infinitary languages, Axiomatizing fixpoint logics, Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics, On strictly arithmetical completeness in logics of programs, Hoare's logic for nondeterministic regular programs: A nonstandard approach, Some questions about expressiveness and relative completeness in Hoare's logic, On the strength of temporal proofs