scientific article; zbMATH DE number 4177049

MaRDI QIDQ3201044zbMATH OpenFDO

Authors S. N. Artëv

Publication date 1990

zbMATH Keywords

diagonalizationextremely undecidable sentencesintuitionistic logicsmodal logicsuniform arithmetical completeness of propositional logics of provability

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)

Recommendations

• scientific article; zbMATH DE number 4079379
• scientific article; zbMATH DE number 1215499
• scientific article; zbMATH DE number 3963790
• Positive provability logic for uniform reflection principles
• Arithmetical completeness theorem for modal logic \(\mathsf{K}\)

Cited in

(11)

• Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
• Proof-theoretic modal PA-completeness. I: A system-sequent metric
• scientific article; zbMATH DE number 6704247 (Why is no real title available?)
• Arithmetical Completeness of the Intuitionistic Logic of Proofs
• Positive provability logic for uniform reflection principles
• scientific article; zbMATH DE number 58101 (Why is no real title available?)
• scientific article; zbMATH DE number 1341927 (Why is no real title available?)
• scientific article; zbMATH DE number 2014521 (Why is no real title available?)
• scientific article; zbMATH DE number 219032 (Why is no real title available?)
• Arithmetical completeness theorems for monotonic modal logics
• On classes of arithmetical counterparts of modal provability logics

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 Q3201044)