scientific article; zbMATH DE number 777292
From MaRDI portal
Publication:4840168
Recommendations
- Cut-Elimination in the Intuitionistic Many-Valued Logic Based on a Partial Order
- Cut elimination in coalgebraic logics
- Cut Elimination for First Order Gödel Logic by Hyperclause Resolution
- A short and readable proof of cut elimination for two first-order modal logics
- Bounds for cut elimination in intuitionistic propositional logic
- scientific article; zbMATH DE number 48659
- Cut Elimination in ε‐Calculi
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- Elementary elimination of prenex cuts in disjunction-free intuitionistic logic
- A cut-elimination proof in intuitionistic predicate logic
Cited in
(26)- Cut technique in valued relational systems: Mainsprings and applications
- The power of Belnap: sequent systems for \(SIXTEEN_{3 }\)
- Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic
- Hypersequent and display calculi -- a unified perspective
- A unifying principle for clause elimination in first-order logic
- Analytic tableaux for all of \(\mathrm{SIXTEEN}_3\)
- Natural deduction for the Sheffer stroke and Peirce's arrow (and any other truth-functional connective)
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
- On Gentzen relations associated with finite-valued logics preserving degrees of truth
- Cut-Elimination in the Intuitionistic Many-Valued Logic Based on a Partial Order
- Canonical signed calculi with multi-ary quantifiers
- MUltlog 1.0: towards an expert system for many-valued logics
- Structural proof theory for first-order weak Kleene logics
- Cut elimination and normalization for generalized single and multi-conclusion sequent and natural deduction calculi
- scientific article; zbMATH DE number 4197951 (Why is no real title available?)
- Density Elimination and Rational Completeness for First-Order Logics
- Epimorphism between Fine and Ferguson’s Matrices for Angell’s AC
- Bisequent calculus for four-valued quasi-relevant logics: cut elimination and interpolation
- Representations of structural closure operators
- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
- On the elimination of quantifier-free cuts
- A general schema for bilateral proof rules
- Incompleteness of a first-order Gödel logic and some temporal logics of programs
- On partial and paraconsistent logics
- Cut-elimination and quantification in canonical systems
- Non-deterministic semantics for logics with a consistency operator
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4840168)