Free logics are cut-free
From MaRDI portal
Publication:2243550
DOI10.1007/s11225-020-09929-8OpenAlexW3120352477MaRDI QIDQ2243550
Publication date: 11 November 2021
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-020-09929-8
Related Items (6)
Tableaux for free logics with descriptions ⋮ Proof-theory and semantics for a theory of definite descriptions ⋮ Neutral free logic: motivation, proof theory and models ⋮ Free Definite Description Theory – Sequent Calculi and Cut Elimination ⋮ Leśniewski's ontology -- proof-theoretic characterization ⋮ A binary quantifier for definite descriptions for cut free free logics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eliminability of cut in hypersequent calculi for some modal logics of linear frames
- A sequent calculus for a negative free logic
- Gentzen calculi for the existence predicate
- A more unified approach to free logics
- Proof theory. 2nd ed
- Constructivism in mathematics. An introduction. Volume II
- On the rules of suppositions in formal logic
- First-order modal logic
- Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions
- Proof Analysis
- CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
- Full Cut Elimination and Interpolation for Intuitionistic Logic with Existence Predicate
- Nonstandard theories of quantification and identity
- Rule-Generation Theorem and its Applications
- An extended joint consistency theorem for a nonconstructive logic of partial terms with definite descriptions
This page was built for publication: Free logics are cut-free