The following pages link to Logics of Formal Inconsistency (Q4928710):
Displaying 50 items.
- Negative modalities, consistency and determinedness (Q276032) (← links)
- Non-deterministic semantics in polynomial format (Q281146) (← links)
- Erotetic search scenarios and three-valued logic (Q302229) (← links)
- Paraconsistency properties in degree-preserving fuzzy logics (Q344078) (← links)
- Proof theory and mathematical meaning of paraconsistent C-systems (Q420832) (← links)
- Dual equivalent two-valued under-determined and over-determined interpretations for Łukasiewicz's 3-valued logic Ł3 (Q484107) (← links)
- Generalizing functional completeness in Belnap-Dunn logic (Q497416) (← links)
- Weakening and extending \(\mathbb{Z}\) (Q497880) (← links)
- Maximal and premaximal paraconsistency in the framework of three-valued semantics (Q631512) (← links)
- Ideal paraconsistent logics (Q647409) (← links)
- Solving conflicts in information merging by a flexible interpretation of atomic propositions (Q650523) (← links)
- Axiomatisations of the genuine three-valued paraconsistent logics \(\mathbf{L3A}_{\mathbf{G}}\) and \(\mathbf{L3B}_{\mathbf{G}}\) (Q828777) (← links)
- A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes (Q895828) (← links)
- Dual erotetic calculi and the minimal \(\mathsf{LFI}\) (Q897482) (← links)
- An informational view of classical logic (Q897935) (← links)
- An NP-complete fragment of fibring logic (Q905999) (← links)
- Non-deterministic semantics for logics with a consistency operator (Q997049) (← links)
- Multi-valued semantics: why and how (Q1037597) (← links)
- What is a non-truth-functional logic? (Q1037600) (← links)
- Generalized correspondence analysis for three-valued logics (Q1632053) (← links)
- Quasi-classical reasoning in paraconsistent databases (Q1653451) (← links)
- Self-extensional three-valued paraconsistent logics (Q1682293) (← links)
- Paraconsistent fuzzy logic preserving non-falsity (Q1697334) (← links)
- Subminimal negation (Q1699743) (← links)
- Paraconsistent logics? (Q1896790) (← links)
- Two semantical approaches to paraconsistent modalities (Q1931347) (← links)
- Negation and paraconsistent logics (Q1942343) (← links)
- Multimodal incompleteness under weak negations (Q1945703) (← links)
- Modal extensions of sub-classical logics for recovering classical logic (Q1945706) (← links)
- A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information (Q1999580) (← links)
- Extensions of Priest-da Costa logic (Q2016069) (← links)
- An epistemic approach to paraconsistency: a logic of evidence and truth (Q2053983) (← links)
- Cut-free sequent calculus and natural deduction for the tetravalent modal logic (Q2062196) (← links)
- Valuation semantics for first-order logics of evidence and truth (Q2079711) (← links)
- First-order logics of evidence and truth with constant and variable domains (Q2084569) (← links)
- Finite two-dimensional proof systems for non-finitely axiomatizable logics (Q2104551) (← links)
- An abductive Question-Answer System for the minimal logic of formal inconsistency \(\mathsf{mbC}\) (Q2118976) (← links)
- Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics (Q2144181) (← links)
- The class of all natural implicative expansions of Kleene's strong logic functionally equivalent to Łukasiewicz's 3-valued logic Ł3 (Q2209169) (← links)
- Paraconsistency in classical logic (Q2219139) (← links)
- Paraconsistent orbits of logics (Q2239383) (← links)
- A Routley-Meyer semantics for Gödel 3-valued logic and its paraconsistent counterpart (Q2254554) (← links)
- DLEAC: a dialetheic logic with exclusive assumptions and conclusions (Q2288266) (← links)
- Finite-valued semantics for canonical labelled calculi (Q2351396) (← links)
- Revisiting \(\mathbb Z\) (Q2443124) (← links)
- Correspondence analysis and automated proof-searching for first degree entailment (Q2663794) (← links)
- A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics (Q2813672) (← links)
- Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi (Q2817945) (← links)
- A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information (Q2915092) (← links)
- Taming Paraconsistent (and Other) Logics (Q2946751) (← links)
