scientific article; zbMATH DE number 1765698
From MaRDI portal
Publication:4539639
Recommendations
- Cut-elimination and quantification in canonical systems
- Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers
- Canonical calculi with (n,k)-ary quantifiers
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
- Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics
Cited in
(55)- Canonical Gentzen-Type Calculi with (n,k)-ary Quantifiers
- Quasi-canonical systems and their semantics
- Effective semantics for the modal logics K and KT via non-deterministic matrices
- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
- From Belnap-Dunn four-valued logic to six-valued logics of evidence and truth
- Canonical signed calculi with multi-ary quantifiers
- Processing Information from a Set of Sources
- RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH
- Paraconsistency and the need for infinite semantics
- On constructive connectives and systems
- Informational semantics, non-deterministic matrices and feasible deduction
- From Inconsistency to Incompatibility
- Semantics and proof-theory of depth bounded Boolean logics
- Gentzen-like systems for partial propositional calculi. I. II
- Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers
- Non-transitive correspondence analysis
- On all strong Kleene generalizations of classical logic
- A novel approach to equality
- A non-deterministic view on non-classical negations
- Cut-elimination and quantification in canonical systems
- A model-theoretic analysis of Fidel-structures for mbC
- Non-deterministic semantics for logics with a consistency operator
- Analytic tableaux for non-deterministic semantics
- Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics
- Tree-like proof systems for finitely-many valued non-deterministic consequence relations
- Mathematical Foundations of Computer Science 2005
- Proof systems for reasoning about computation errors
- On negation: Pure local rules
- The logicality of equality
- Tableau systems for some Ivlev-like (quantified) modal logics
- Non-deterministic logic of generalized classical truth values
- On non-deterministic functional completeness
- Logical multilateralism
- An informational view of classical logic
- Three-valued logic for reasoning about covering-based rough sets
- Canonical constructive systems
- Hypersequent rules with restricted contexts for propositional modal logics
- A Category of Ordered Algebras Equivalent to the Category of Multialgebras
- Swap structures semantics for Ivlev-like modal logics
- Cut elimination for shallow modal logics
- Kripke Semantics for Basic Sequent Systems
- Finite non-deterministic semantics for some modal systems
- Cut elimination in coalgebraic logics
- Strict canonical constructive systems
- What is a logic translation?
- Free Definite Description Theory – Sequent Calculi and Cut Elimination
- Weakly Free Multialgebras
- Towards a semantic characterization of cut-elimination
- Sufficient conditions for cut elimination with complexity analysis
- Non-deterministic logic of informal provability has no finite characterization
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
- Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics
- Finite-valued semantics for canonical labelled calculi
- Degree-preserving Gödel logics with an involution: intermediate logics and (ideal) paraconsistency
- An Analytic Propositional Proof System on Graphs
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 Q4539639)
