Computational properties of partial non-deterministic matrices and their logics

DOI10.1007/978-3-030-93100-1_12OpenAlexW4200394534MaRDI QIDQ2151408

Pedro Filipe, Sérgio Marcelino, Carlos Caleiro

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93100-1_12

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What is a non-truth-functional logic?
• Closure properties and decision problems of dag automata
• Theory of logical calculi. Basic theory of consequence operations
• An unexpected Boolean connective
• Analytic calculi for monadic PNmatrices
• Finite-valued semantics for canonical labelled calculi
• Taming Paraconsistent (and Other) Logics
• Non-deterministic Multiple-valued Structures
• On the characterization of fibred logics, with applications to conservativity and finite-valuedness
• Reducibility among Combinatorial Problems
• On Axioms and Rexpansions
• REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS
• Function Algebras on Finite Sets
• The complexity of theorem-proving procedures
• A test for the existence of tautologies according to many-valued truth-tables
• A test for the equality of truth-tables
• Axiomatizing non-deterministic many-valued generalized consequence relations

This page was built for publication: Computational properties of partial non-deterministic matrices and their logics