An unexpected Boolean connective

DOI10.1007/s11787-021-00280-7OpenAlexW3175375473MaRDI QIDQ2169126

Sérgio Marcelino

Publication date: 1 September 2022

Published in: Logica Universalis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.05404

zbMATH Keywords

axiomatizabilityanalytic calculinon-deterministic semanticsBoolean-connectivesgeneralized truth-functionalitymultiple-conclusion rulestwo-valued logics

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50)

Related Items (2)

Computational properties of partial non-deterministic matrices and their logics ⋮ Finite two-dimensional proof systems for non-finitely axiomatizable logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• The complexity of propositional implication
• Proof systems for reasoning about computation errors
• Closure properties and decision problems of dag automata
• 2-element matrices
• Theory of logical calculi. Basic theory of consequence operations
• Disjoint fibring of non-deterministic matrices
• Eliminating disjunctions by disjunction elimination
• Characterizing finite-valuedness
• On the representation of \(\mathbf{N4}\)-lattices
• Logics of left variable inclusion and Płonka sums of matrices
• Analytic calculi for monadic PNmatrices
• Combining fragments of classical logic: when are interaction principles needed?
• Swap structures semantics for Ivlev-like modal logics
• Finite-valued semantics for canonical labelled calculi
• Implicative twist-structures
• Taming Paraconsistent (and Other) Logics
• Non-deterministic Multiple-valued Structures
• Fibring of logics as a categorial construction
• Decision and optimization problems in the unreliable-circuit logic
• On meet-combination of logics
• On Axioms and Rexpansions
• Approximate reasoning about logic circuits with single-fan-out unreliable gates
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: An unexpected Boolean connective