An Arithmetically Complete Predicate Modal Logic

DOI10.18778/0138-0680.2021.18zbMath1529.03151OpenAlexW3193790318MaRDI QIDQ6043018

Unnamed Author, George Tourlakis

Publication date: 4 May 2023

Published in: Bulletin of the Section of Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.18778/0138-0680.2021.18

zbMATH Keywords

predicate modal logicequational proofsSolovay's theoremarithmetic completenesslogic GL

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Related Items (1)

AN ESCAPE FROM VARDANYAN’S THEOREM

Cites Work

• On the proof-theory of two formalisations of modal first-order logic
• The predicate modal logic of provability
• Self-reference and modal logic
• Provability interpretations of modal logic
• A Short and Readable Proof of Cut Elimination for Two First-Order Modal Logics
• A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
• Failures of the interpolation lemma in quantified modal logic
• Finite Kripke models and predicate logics of provability
• A completeness theorem in modal logic
• A Modal Extension of Weak Generalisation Predicate Logic
• On modal systems having arithmetical interpretations
• Adding the everywhere operator to propositional logic
• Grundlagen der Mathematik I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Arithmetically Complete Predicate Modal Logic