A binary quantifier for definite descriptions for cut free free logics

DOI10.1007/S11225-021-09958-XMaRDI QIDQ2115288zbMATH OpenOpenAlexFDO

Authors Nils Kürbis

Publication date 15 March 2022

Published in Studia Logica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

definite descriptionscut eliminationsequent calculusfree logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• A binary quantifier for definite descriptions in intuitionist negative free logic: natural deduction and normalisation
• Definite descriptions in intuitionist positive free logic
• Free Definite Description Theory – Sequent Calculi and Cut Elimination
• Two treatments of definite descriptions in intuitionist negative free logic
• Fregean Description Theory in Proof-Theoretical Setting

Cites work

• scientific article; zbMATH DE number 47929 (Why is no real title available?)
• scientific article; zbMATH DE number 1028821 (Why is no real title available?)
• scientific article; zbMATH DE number 1064418 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 1867298 (Why is no real title available?)
• scientific article; zbMATH DE number 1867299 (Why is no real title available?)
• scientific article; zbMATH DE number 7585722 (Why is no real title available?)
• A binary quantifier for definite descriptions in intuitionist negative free logic: natural deduction and normalisation
• A logical calculus with descriptions
• Definite descriptions in intuitionist positive free logic
• First-order modal logic
• Free Definite Description Theory – Sequent Calculi and Cut Elimination
• Free logics are cut-free
• Fregean Description Theory in Proof-Theoretical Setting
• Incomplete symbols -- definite descriptions revisited
• Modal logic for philosophers
• Two treatments of definite descriptions in intuitionist negative free logic

Cited in

(7)

• Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
• Proof-theory and semantics for a theory of definite descriptions
• A Binary Quantifier for Definite Descriptions for Cut Free Free Logics
• Eigenvariables, bracketing and the decidability of positive minimal predicate logic
• A cut-free, sound and complete Russellian theory of definite descriptions
• Towards proof-theoretic formulation of the general theory of term-forming operators
• Free Definite Description Theory – Sequent Calculi and Cut Elimination

This page was built for publication: A binary quantifier for definite descriptions for cut free free logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115288)