Arithmetical completeness theorem for modal logic \(\mathsf{K}\)

DOI10.1007/s11225-017-9735-yzbMath1437.03090OpenAlexW2623438580MaRDI QIDQ1743993

Taishi Kurahashi

Publication date: 16 April 2018

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

Full work available at URL: https://doi.org/10.1007/s11225-017-9735-y

zbMATH Keywords

provability logicnumerationsarithmetical completeness theoremformalized arithmetic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items

The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb, Rosser provability and normal modal logics, Arithmetical completeness theorems for monotonic modal logics, ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM, Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations, PROVABILITY LOGICS RELATIVE TO A FIXED EXTENSION OF PEANO ARITHMETIC, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS

Cites Work

• Unnamed Item
• Four valued semantics and the Liar
• Provability interpretations of modal logic
• On the algebraization of a Feferman's predicate. (The algebraization of theories which express Theor; X)
• Peano's smart children: A provability logical study of systems with built-in consistency
• A smart child of Peano's
• Arithmetization of metamathematics in a general setting
• ON THE CLASSIFICATION OF PROPOSITIONAL PROVABILITY LOGICS
• Models of axiomatic systems