A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs

DOI10.18778/0138-0680.45.1.02zbMath1404.03020OpenAlexW2618809050WikidataQ113729590 ScholiaQ113729590MaRDI QIDQ2957670

George Tourlakis

Publication date: 27 January 2017

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.45.1.02

zbMATH Keywords

modal logicfirst-order logiccut eliminationproof theorydisjunction propertyquantified modal logicGLreflection propertyarithmetical completenessQGL

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Classical first-order logic (03B10) Cut-elimination and normal-form theorems (03F05)

Related Items (1)

An Arithmetically Complete Predicate Modal Logic

Cites Work

• On the proof-theory of two formalisations of modal first-order logic
• The predicate modal logic of provability
• The modal logic of provability. The sequential approach
• A modal sequent calculus for a fragment of arithmetic
• Finite Kripke models and predicate logics of provability
• A Modal Extension of Weak Generalisation Predicate Logic
• On modal systems having arithmetical interpretations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs