Non-deterministic Multiple-valued Structures

DOI10.1093/logcom/exi001zbMath1070.03010MaRDI QIDQ3025337

Arnon Avron, Iddo Lev

Publication date: 13 July 2005

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/90c4951e54d7fe33f1c50a4250961a4bacd31db9

zbMATH Keywords

uncertainty; automated reasoning; compactness; decidability; non-determinism; paraconsistent reasoning; Multi-valued logics

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

03B25: Decidability of theories and sets of sentences

03B35: Mechanization of proofs and logical operations

03B50: Many-valued logic

03B53: Paraconsistent logics

Related Items

Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics, On Discourses Addressed by Infidel Logicians, A Note on Ciuciura’s mbC1, Tutorial on Inconsistency-Adaptive Logics, Three-Valued Paraconsistent Propositional Logics, Three-Valued Logic for Reasoning about Covering-Based Rough Sets, 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09, REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS, 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06, Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency, Towards an algorithmic construction of cut-elimination procedures, Informational semantics, non-deterministic matrices and feasible deduction, Canonical signed calculi with multi-ary quantifiers, Efficient reasoning with inconsistent information using C-systems, Maximal and premaximal paraconsistency in the framework of three-valued semantics, Ideal paraconsistent logics, Cut-elimination and quantification in canonical systems, An informational view of classical logic, Non-deterministic semantics for logics with a consistency operator, Rough sets and 3-valued logics, Proof systems for reasoning about computation errors, Multi-valued semantics: why and how, What is a non-truth-functional logic?, Compositional meaning in logic, Four-valued paradefinite logics, On non-deterministic quantification, A dissimilarity-based framework for generating inconsistency-tolerant logics, Hypersequent and display calculi -- a unified perspective, Paraconsistency and the need for infinite semantics, Swap structures semantics for Ivlev-like modal logics, Finite-valued semantics for canonical labelled calculi, Sufficient conditions for cut elimination with complexity analysis, Tools for the Investigation of Substructural and Paraconsistent Logics, ON THE WAY TO A WIDER MODEL THEORY: COMPLETENESS THEOREMS FOR FIRST-ORDER LOGICS OF FORMAL INCONSISTENCY, Taming Paraconsistent (and Other) Logics, Basic Constructive Connectives, Determinism and Matrix-Based Semantics, Plug and Play Negations, Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism, 2005–06 Winter Meeting of the Association for Symbolic Logic, Reasoning with Uncertainty by Nmatrix–Metric Semantics, Strict Canonical Constructive Systems, Processing Information from a Set of Sources, Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination, Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data, Classic-Like Analytic Tableaux for Finite-Valued Logics, Possible-translations semantics for some weak classically-based paraconsistent logics