Non-deterministic Multiple-valued Structures
From MaRDI portal
Publication:3025337
DOI10.1093/logcom/exi001zbMath1070.03010OpenAlexW2073897909MaRDI QIDQ3025337
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
uncertaintyautomated reasoningcompactnessdecidabilitynon-determinismparaconsistent reasoningMulti-valued logics
Reasoning under uncertainty in the context of artificial intelligence (68T37) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50) Paraconsistent logics (03B53)
Related Items (62)
A Note on Calculi for Non-deterministic Many-valued Logics ⋮ Informational semantics, non-deterministic matrices and feasible deduction ⋮ Analytic tableaux for non-deterministic semantics ⋮ Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics ⋮ Implication, Equivalence, and Negation ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Computational properties of partial non-deterministic matrices and their logics ⋮ An unexpected Boolean connective ⋮ 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 ⋮ Paraconsistency, paracompleteness, Gentzen systems, and trivalent semantics ⋮ Taming Paraconsistent (and Other) Logics ⋮ Compositional meaning in logic ⋮ Four-valued paradefinite logics ⋮ Sequent-type rejection systems for finite-valued non-deterministic logics ⋮ Quasi-canonical systems and their semantics ⋮ Axiomatizing non-deterministic many-valued generalized consequence relations ⋮ Canonical signed calculi with multi-ary quantifiers ⋮ An informational view of classical logic ⋮ Monstrous content and the bounds of discourse ⋮ Reasoning with Uncertainty by Nmatrix–Metric Semantics ⋮ Maximal and premaximal paraconsistency in the framework of three-valued semantics ⋮ A Note on Ciuciura’s mbC1 ⋮ Ideal paraconsistent logics ⋮ REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS ⋮ Tree-like proof systems for finitely-many valued non-deterministic consequence relations ⋮ Sufficient conditions for cut elimination with complexity analysis ⋮ Plug and Play Negations ⋮ Basic Constructive Connectives, Determinism and Matrix-Based Semantics ⋮ On Discourses Addressed by Infidel Logicians ⋮ Efficient reasoning with inconsistent information using C-systems ⋮ On non-deterministic quantification ⋮ A dissimilarity-based framework for generating inconsistency-tolerant logics ⋮ 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 ⋮ Hypersequent and display calculi -- a unified perspective ⋮ Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency ⋮ Strict Canonical Constructive Systems ⋮ Processing Information from a Set of Sources ⋮ Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination ⋮ Non-deterministic semantics for logics with a consistency operator ⋮ Towards an algorithmic construction of cut-elimination procedures ⋮ Rough sets and 3-valued logics ⋮ Proof systems for reasoning about computation errors ⋮ Non-deterministic Distance Semantics for Handling Incomplete and Inconsistent Data ⋮ Classic-Like Analytic Tableaux for Finite-Valued Logics ⋮ Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism ⋮ Possible-translations semantics for some weak classically-based paraconsistent logics ⋮ Paraconsistency and the need for infinite semantics ⋮ Swap structures semantics for Ivlev-like modal logics ⋮ Non-deterministic logic of informal provability has no finite characterization ⋮ Multi-valued semantics: why and how ⋮ What is a non-truth-functional logic? ⋮ Tutorial on Inconsistency-Adaptive Logics ⋮ Three-Valued Paraconsistent Propositional Logics ⋮ 2005–06 Winter Meeting of the Association for Symbolic Logic ⋮ Three-Valued Logic for Reasoning about Covering-Based Rough Sets ⋮ A family of genuine and non-algebraisable C-systems ⋮ Finite two-dimensional proof systems for non-finitely axiomatizable logics ⋮ Introduction: Non-classical Logics—Between Semantics and Proof Theory (In Relation to Arnon Avron’s Work) ⋮ On Axioms and Rexpansions ⋮ Finite-valued semantics for canonical labelled calculi ⋮ Cut-elimination and quantification in canonical systems
This page was built for publication: Non-deterministic Multiple-valued Structures
