Pages that link to "Item:Q3149220"

The following pages link to Formal inconsistency and evolutionary databases (Q3149220):

Displaying 41 items.

• Revisiting da Costa logic (Q301378) (← links)
• Classical negation and expansions of Belnap-Dunn logic (Q495842) (← 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)
• Generalized correspondence analysis for three-valued logics (Q1632053) (← links)
• There is more to negation than modality (Q1749806) (← links)
• Valuation semantics for first-order logics of evidence and truth (Q2079711) (← links)
• Tableaux and restricted quantification for systems related to weak Kleene logic (Q2142060) (← links)
• Revisiting \(\mathbb Z\) (Q2443124) (← links)
• A paraconsistent logic programming approach for querying inconsistent databases (Q2463646) (← links)
• Monstrous content and the bounds of discourse (Q2686088) (← links)
• Logical foundations and complexity of 4QL, a query language with unrestricted negation (Q2901212) (← links)
• A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information (Q2915092) (← links)
• Variations on the Collapsing Lemma (Q3305667) (← links)
• Literal-paraconsistent and literal-paracomplete matrices (Q3419671) (← links)
• Processing Information from a Set of Sources (Q3600567) (← links)
• A computational interpretation of conceptivism (Q4583359) (← links)
• On polynomial semantics for propositional logics (Q4586158) (← links)
• Paraconsistent constructive logic with strong negation as a contraction-free relevant logic (Q4586423) (← links)
• AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX (Q4600826) (← links)
• Exactly true and non-falsity logics meeting infectious ones (Q4995617) (← links)
• SOME MODEL-THEORETIC RESULTS ON THE 3-VALUED PARACONSISTENT FIRST-ORDER LOGIC <b>QCIORE</b> (Q5001546) (← links)
• Twist-Valued Models for Three-Valued Paraconsistent Set Theory (Q5013621) (← links)
• Credal Calculi, Evidence, and Consistency (Q5020164) (← links)
• A Note on Ciuciura’s mbC1 (Q5126191) (← links)
• Natural implicative expansions of variants of Kleene's strong 3-valued logic with Gödel-type and dual Gödel-type negation (Q5156187) (← links)
• From Paraconsistent Logic to Dialetheic Logic (Q5213760) (← links)
• A RECOVERY OPERATOR FOR NONTRANSITIVE APPROACHES (Q5221290) (← links)
• Tutorial on Inconsistency-Adaptive Logics (Q5241516) (← links)
• On the Philosophy and Mathematics of the Logics of Formal Inconsistency (Q5241518) (← links)
• A Paraconsistent Logic Obtained from an Algebra-Valued Model of Set Theory (Q5241523) (← links)
• Two, Many, and Differently Many (Q5350334) (← links)
• Many-Valued Non-deterministic Semantics for First-Order Logics of Formal (In)consistency (Q5425994) (← links)
• Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values (Q5742698) (← links)
• A class of implicative expansions of Belnap-Dunn logic in which Boolean negation is definable (Q6098217) (← links)
• Non-transitive correspondence analysis (Q6156626) (← links)
• A cartography of LFIs and truth (Q6623945) (← links)
• Many-valued modalities and paraconsistency (Q6623951) (← links)
• On three-valued presentations of classical logic (Q6638231) (← links)