A binary quantifier for definite descriptions for cut free free logics
From MaRDI portal
Publication:2115288
DOI10.1007/S11225-021-09958-XOpenAlexW3195923729MaRDI QIDQ2115288FDOQ2115288
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Incomplete symbols -- definite descriptions revisited
- First-order modal logic
- A logical calculus with descriptions
- Free logics are cut-free
- Fregean Description Theory in Proof-Theoretical Setting
- 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
- A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation
Cited In (7)
- Eigenvariables, bracketing and the decidability of positive minimal predicate logic
- A Binary Quantifier for Definite Descriptions for Cut Free Free Logics
- Proof-theory and semantics for a theory of definite descriptions
- Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
- Free Definite Description Theory – Sequent Calculi and Cut Elimination
- A cut-free, sound and complete Russellian theory of definite descriptions
- Towards proof-theoretic formulation of the general theory of term-forming operators
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)
