scientific article; zbMATH DE number 3648682
From MaRDI portal
Publication:3206928
Cited in
(only showing first 100 items - show all)- A Weakening of Alpha Graphs: Quasi-Boolean Algebras
- Revisiting four-valued logics from \textit{Maple} using the \textit{Logics Explorer} package
- Semantical analysis of weak Kleene logics
- Stalnakerian connexive logics
- Relational semantics for normal topological quasi-Boolean logic
- A four-valued dynamic epistemic logic
- A simple signed system for paraconsistent reasoning
- The problem of rational knowledge
- Quasi-canonical systems and their semantics
- A logical semantics for depth-first Prolog with ground negation
- On deductive bases for paraconsistent answer set semantics
- De Morgan clones and four-valued logics
- Polarity semantics for negation as a modal operator
- Free choice reasons
- Not necessarily distributive fuzzy semantics for multiple-conclusion sequent calculi with weak structural rules
- On logics of perfect paradefinite algebras
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Neutrosophic logics: Prospects and problems
- Processing Information from a Set of Sources
- A capacity-based framework encompassing Belnap-Dunn logic for reasoning about multisource information
- Logics of upsets of De Morgan lattices
- Resolution approximation of first-order logics
- Natural deduction systems for some modifications of Kleene's and Dunn-Belnap's logics
- A sequent calculus for reasoning in four-valued description logics
- scientific article; zbMATH DE number 6973869 (Why is no real title available?)
- Paraconsistency and the need for infinite semantics
- Two consistent many-valued logics for paraconsistent phenomena
- Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values
- Boole-De Morgan bilattices
- Implicit, explicit and speculative knowledge
- Conjunctive paraconsistency
- Bisequent calculus for four-valued quasi-relevant logics: cut elimination and interpolation
- Many-valuedness from a universal logic perspective
- A computational interpretation of conceptivism
- Interpolation in 16-valued trilattice logics
- Defining rough sets as core-support pairs of three-valued functions
- On the quantified version of the Belnap-Dunn modal logic
- Non-dual modal operators as a basis for 4-valued accessibility relations in hybrid logic
- Limited reasoning in first-order knowledge bases
- Paraconsistent logic programming
- Inconsistency and semantic unification
- Fuzzy types: A framework for handling uncertainty about types of objects
- Cut elimination, identity elimination, and interpolation in super-Belnap logics
- Disentangling \textsf{FDE}-based paraconsistent modal logics
- Four-valued paradefinite logics
- A note on entropy of logic
- Ordering default theories and nonmonotonic logic programs
- Exactly true and non-falsity logics meeting infectious ones
- Pecularities of some three- and four-valued second order logics
- An epistemic interpretation of paraconsistent weak Kleene logic
- The relevance of relevance to relevance logic
- Stone-type representations and dualities for varieties of bisemilattices
- Being Consistent About Inconsistency: Toward the Rational Fusing of Inconsistent Propositional Logic Bases
- A generalization of ACP using Belnap's logic
- Substructural epistemic logics
- God, Gluts and Gaps: Examining an Islamic Traditionalist Case for a Contradictory Theology
- On all strong Kleene generalizations of classical logic
- Reductio ad contradictionem: an algebraic perspective
- Four-valued logics \(\mathbf {BD}\) and \(\mathbf {DM4}\): expansions
- A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes
- A four-valued semantics for terminological logics
- On gluts in mathematics and science
- Programming with annotated logics
- A capacity-based semantics for inconsistency-tolerant inferences
- The method of Socratic proofs meets correspondence analysis
- Belief revision in non-classical logics
- The class of all natural implicative expansions of Kleene's strong logic functionally equivalent to Łukasiewicz's 3-valued logic Ł3
- Impossible worlds and the logic of imagination
- Correspondence analysis for logic of rational agent
- Paraconsistent logic, evidence, and justification
- The logic determined by Smiley's matrix for Anderson and Belnap's first-degree entailment logic
- Dialogue games for many-valued logics -- an overview
- A modal theorem-preserving translation of a class of three-valued logics of incomplete information
- Model Checking for Action Abstraction
- A general framework for FDE-based modal logics
- Combining explicit negation and negation by failure via Belnap's logic
- Quotients of d-frames
- Belnap constants and Nelson logic
- Countably many weakenings of Belnap-Dunn logic
- Probabilities with gaps and gluts
- Bilattice logic properly displayed
- Bi-oriented graphs and four valued logic for preference modelling
- A Gentzen calculus for nothing but the truth
- Preferences in artificial intelligence
- Normalisation for some quite interesting many-valued logics
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
- A useful four-valued extension of the temporal logic \(\mathsf{K}_{\mathsf t}\mathsf{T4}\)
- Bi-classical connexive logic and its modal extension: cut-elimination, completeness and duality
- Judging actions on the basis of prima facie duties. The case of self-driving cars
- Towards declarative comparabilities: application to functional dependencies
- Relation-changing models meet paraconsistency
- Distance-based paraconsistent logics
- Rules of explosion and excluded middle: constructing a unified single-succedent Gentzen-style framework for classical, paradefinite, paraconsistent, and paracomplete logics
- Notes on models of (partial) Kripke-Feferman truth
- YinYang bipolar logic and bipolar fuzzy logic
- On a multilattice analogue of a hypersequent S5 calculus
- Conservative translations of four-valued logics in modal logic
- An encompassing framework for paraconsistent logic programs
- Correspondence analysis and automated proof-searching for first degree entailment
- Data repair of inconsistent nonmonotonic description logic programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206928)