A binary quantifier for definite descriptions for cut free free logics

DOI10.1007/s11225-021-09958-xOpenAlexW3195923729MaRDI QIDQ2115288

Nils Kürbis

Publication date: 15 March 2022

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

Full work available at URL: https://arxiv.org/abs/2108.09777

zbMATH Keywords

free logiccut eliminationsequent calculusdefinite descriptions

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items

Proof-theory and semantics for a theory of definite descriptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incomplete symbols -- definite descriptions revisited
• A logical calculus with descriptions
• First-order modal logic
• Free logics are cut-free
• Free Definite Description Theory – Sequent Calculi and Cut Elimination
• Definite Descriptions in Intuitionist Positive Free Logic
• Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic
• Fregean Description Theory in Proof-Theoretical Setting
• A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation