Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
From MaRDI portal
Publication:744990
DOI10.1016/j.tcs.2015.07.016zbMath1331.03024arXiv1408.3775OpenAlexW2098322793WikidataQ61593294 ScholiaQ61593294MaRDI QIDQ744990
João Marcos, Carlos Caleiro, Marco Volpe
Publication date: 12 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.3775
Related Items
Proof search on bilateralist judgments over non-deterministic semantics, Translating non-classical logics into classical logic by using hidden variables, An Inferentially Many-Valued Two-Dimensional Notion of Entailment, Compositional meaning in logic, A note on two's company: ``The humbug of many logical values, Axiomatizing non-deterministic many-valued generalized consequence relations, Rasiowa-Sikorski deduction systems with the rule of cut: a case study, An informational view of classical logic, Two-sided sequent calculi for \textit{FDE}-like four-valued logics, Non-distributive relatives of ETL and NFL, SUSZKO’S PROBLEM: MIXED CONSEQUENCE AND COMPOSITIONALITY, On Axioms and Rexpansions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Truth and falsehood. An inquiry into generalized logical values
- A non-deterministic view on non-classical negations
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- What is a non-truth-functional logic?
- Don't eliminate cut
- Theory of logical calculi. Basic theory of consequence operations
- A semantical analysis of the calculi \(C_n\)
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- Effective Finite-Valued Semantics for Labelled Calculi
- Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics
- Classic-Like Analytic Tableaux for Finite-Valued Logics
- Algebraizable logics
- The Taming of the Cut. Classical Refutations with Analytic Cut
- Finitely many-valued logics and natural deduction
- A Machine-Oriented Logic Based on the Resolution Principle
- On notation for ordinal numbers
- Axiom schemes for m-valued propositions calculi