A simplification of the completeness proofs for Guaspari and Solovay's R

DOI10.1305/NDJFL/1093635332zbMATH Open0712.03010OpenAlexW2008911115MaRDI QIDQ923070FDOQ923070

Authors: Frans Voorbraak 

Publication date: 1990

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093635332

Recommendations

• A simplification of a completeness proof of Guaspari and Solovay
• scientific article; zbMATH DE number 1868521
• scientific article; zbMATH DE number 93462
• Sufficient-completeness, ground-reducibility and their complexity
• The Completeness of Propositional Resolution: A Simple and Constructive Proof
• scientific article; zbMATH DE number 5292743
• A simplified proof of arithmetical completeness theorem for provability logic GLP
• Completeness results for inequality provers
• A remark concerning decidability of complete theories
• A simple proof of completeness and cut-admissibility for propositional Gödel logic

zbMATH Keywords

provability logicarithmetical completenessGuaspari and Solovay's modal logic RKripke model completenesstail modelswitness comparison

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Cited In (8)

• The incompleteness of RGL
• Uniform density in Lindenbaum algebras
• Much Shorter Proofs
• On the proof of Solovay's theorem
• Rosser orderings and free variables
• A simplification of a completeness proof of Guaspari and Solovay
• Syntactical results on the arithmetical completeness of modal logic
• Self-reference in arithmetic. II

This page was built for publication: A simplification of the completeness proofs for Guaspari and Solovay's R

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