Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach
From MaRDI portal
Publication:2679583
DOI10.1007/S10992-021-09639-ZOpenAlexW3215699654MaRDI QIDQ2679583FDOQ2679583
Authors: Pablo Cobreros, Elio La Rosa, Luca Tranchini
Publication date: 23 January 2023
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10992-021-09639-z
Recommendations
paraconsistencyparacompletenessthree-valued logiclabelled sequent calculusmeta-inferencehigher-level rules
Cites Work
- The logics of strict-tolerant logic
- Derivability and metainferential validity
- Methoden zur Axiomatisierung beliebiger Aussagen- und Prädikatenkalküle
- ST, LP and tolerant metainferences
- Tolerant, classical, strict
- A fully classical truth theory characterized by substructural means
- Sequents in many valued logic I
- Title not available (Why is that?)
- Deep sequent systems for modal logic
- The Method of Tree-Hypersequents for Modal Propositional Logic
- Cut-free sequent calculi for some tense logics
- A natural extension of natural deduction
- Automated deduction for many-valued logics
- Classical logic and the strict tolerant hierarchy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A hierarchy of classical and paraconsistent logics
- A family of metainferential logics
- Transfinite meta-inferences
- Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices
Cited In (4)
Uses Software
This page was built for publication: Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679583)