Arithmetical completeness versus relative completeness

DOI10.1007/BF00370552zbMath0667.03018MaRDI QIDQ1117212

Michał Grabowski

Publication date: 1989

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

dynamic logicnonstandard modelsSkolemizationarithmetical completenessfinitistic proof systems

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Nonstandard models of arithmetic (03H15)

Cites Work

• Unnamed Item
• Sound and complete Hoare-like calculi based on copy rules
• Effective Axiomatizations of Hoare Logics
• Ten Years of Hoare's Logic: A Survey—Part I
• Soundness and Completeness of an Axiom System for Program Verification
• Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems

This page was built for publication: Arithmetical completeness versus relative completeness