The following pages link to The value of the four values (Q1274293):
Displaying 50 items.
- On all strong Kleene generalizations of classical logic (Q295922) (← links)
- A Gentzen calculus for nothing but the truth (Q312499) (← links)
- Preferences in artificial intelligence (Q314443) (← links)
- Bilattices with implications (Q368472) (← links)
- Super-De Morgan functions and free De Morgan quasilattices (Q403200) (← links)
- Hilbert-style presentations of two logics associated to tetravalent modal algebras (Q456967) (← links)
- Belief functions on distributive lattices (Q490415) (← links)
- Generalizing functional completeness in Belnap-Dunn logic (Q497416) (← links)
- A calculus for four-valued sequential logic (Q549178) (← links)
- Ideal paraconsistent logics (Q647409) (← links)
- Proof theory of Nelson's paraconsistent logic: a uniform perspective (Q764309) (← links)
- Four valued semantics and the Liar (Q798313) (← links)
- A non-deterministic view on non-classical negations (Q813081) (← links)
- Gentzen-type methods for bilattice negation (Q813084) (← links)
- Some useful 16-valued logics: How a computer network should think (Q815018) (← links)
- De Morgan clones and four-valued logics (Q829759) (← links)
- A family of strict/tolerant logics (Q830368) (← links)
- Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion (Q830398) (← links)
- Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation (Q865046) (← links)
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks (Q901144) (← links)
- A few more useful 8-valued logics for reasoning with tetralattice \(EIGHT_{4}\) (Q1037603) (← links)
- Four-valued logic (Q1422105) (← links)
- Quantifying conflicts in propositional logic through prime implicates (Q1680686) (← links)
- Four-valued paradefinite logics (Q1685565) (← links)
- Interpolation methods for Dunn logics and their extensions (Q1685574) (← links)
- Stone-type representations and dualities for varieties of bisemilattices (Q1744009) (← links)
- Restricted semantics for default reasoning (Q1757453) (← links)
- Double-faced rough sets and rough communication (Q1810437) (← links)
- Parametrized semantics of logic programs -- a unifying framework (Q1884892) (← links)
- Contradictory information: too much of a good thing (Q1959325) (← links)
- Bilattice logic of epistemic actions and knowledge (Q1987215) (← links)
- Modal extension of ideal paraconsistent four-valued logic and its subsystem (Q2004955) (← links)
- Strengthening Brady's paraconsistent 4-valued logic BN4 with truth-functional modal operators (Q2011822) (← links)
- A hierarchy of weak double negations (Q2016059) (← links)
- Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi (Q2062192) (← links)
- Neighbourhood semantics for FDE-based modal logics (Q2062194) (← links)
- Falsification-aware semantics and sequent calculi for classical logic (Q2078978) (← links)
- Embedding friendly first-order paradefinite and connexive logics (Q2079706) (← links)
- An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi (Q2084568) (← links)
- An algebraic theory for data linkage (Q2185883) (← links)
- Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic (Q2186695) (← links)
- Free choice reasons (Q2219154) (← links)
- Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation (Q2236504) (← links)
- Lattice logic, bilattice logic and paraconsistent quantum logic: a unified framework based on monosequent systems (Q2236604) (← links)
- De Morgan functions and free De Morgan algebras. (Q2248023) (← links)
- Distance-based paraconsistent logics (Q2270429) (← links)
- Bilattice logic properly displayed (Q2328914) (← links)
- Analysing inconsistent first-order knowledgebases (Q2389648) (← links)
- Any-world assumptions in logic programming (Q2566297) (← links)
- Correspondence analysis and automated proof-searching for first degree entailment (Q2663794) (← links)
