Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
From MaRDI portal
(Redirected from Publication:874747)
Recommendations
- scientific article; zbMATH DE number 63610
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Minimal sequent calculi for monotonic chain finitely-valued logics
- Intuitionistic sequent calculi for finitely many-valued logics
- Minimal sequent calculi for Lukasiewicz's finitely-valued logics
Cited in
(27)- Finite two-dimensional proof systems for non-finitely axiomatizable logics
- Proof search on bilateralist judgments over non-deterministic semantics
- Processing Information from a Set of Sources
- Exactly true and non-falsity logics meeting infectious ones
- Non-transitive correspondence analysis
- Three-valued paraconsistent propositional logics
- Generalizing functional completeness in Belnap-Dunn logic
- Cut-free sequent calculus and natural deduction for the tetravalent modal logic
- Tree-like proof systems for finitely-many valued non-deterministic consequence relations
- Taming paraconsistent (and other) logics: an algorithmic approach
- Proof systems for reasoning about computation errors
- Automated support for the investigation of paraconsistent and other logics
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
- Correspondence analysis and automated proof-searching for first degree entailment
- scientific article; zbMATH DE number 6863649 (Why is no real title available?)
- Non-deterministic logic of generalized classical truth values
- Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation
- Two, Many, and Differently Many
- Sequent-type rejection systems for finite-valued non-deterministic logics
- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
- Axiomatizing non-deterministic many-valued generalized consequence relations
- A variant with the variable-sharing property of Brady's 4-valued implicative expansion BN4 of Anderson and Belnap's logic FDE
- A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications
- Self-extensional three-valued paraconsistent logics
- On Axioms and Rexpansions
- The normal and self-extensional extension of Dunn-Belnap logic
- An unexpected Boolean connective
This page was built for publication: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874747)
