How a Computer Should Think
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 3504935 (Why is no real title available?)
- scientific article; zbMATH DE number 3537646 (Why is no real title available?)
- scientific article; zbMATH DE number 3304023 (Why is no real title available?)
- scientific article; zbMATH DE number 3379785 (Why is no real title available?)
- scientific article; zbMATH DE number 3099235 (Why is no real title available?)
- Epistemology without knowledge and without belief
- First degree entailments
- Intuitive semantics for first-degree entailments and `coupled trees'
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- The Semantics of First Degree Entailment
Cited in
(38)- Iterating both and neither: with applications to the paradoxes
- A Variant of Material Connexive Logic
- How a computer might reason in terms of Boolean many-valuedness
- Constraint tableaux for two-dimensional fuzzy logics
- Structure of the rational monoid algebra for Boolean matrices of order 3
- A postulate-driven study of logical argumentation
- Reasoning with belief functions over Belnap-Dunn logic
- From Belnap-Dunn four-valued logic to six-valued logics of evidence and truth
- \(T\)-rough symmetric Heyting algebras with tense operators
- A calculus for four-valued sequential logic
- Variable domain first-order first-degree entailment and some of its children
- Basic Four-Valued Systems of Cyclic Negations
- Two-layered logics for probabilities and belief functions over Belnap-Dunn logic
- Cut elimination, identity elimination, and interpolation in super-Belnap logics
- Toward updating belief functions over Belnap-Dunn logic
- On universally free first-order extensions of Belnap-Dunn's four-valued logic and Nelson's paraconsistent logic \(N{4}\)
- A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes
- Paraconsistent Gödel modal logic
- Paraconsistent and paracomplete Zermelo-Fraenkel set theory
- Probabilities with gaps and gluts
- Bilattice logic properly displayed
- Preferences in discrete multi-adjoint formal concept analysis
- Gentzen in the 3- and 4-valued jungle
- Tableaux for metainferential logics
- Presumptive Reasoning in a Paraconsistent Setting
- A logical consequence informed by probability
- scientific article; zbMATH DE number 7455717 (Why is no real title available?)
- How We Think of Computing Today
- Intuitionistic propositional probability logic
- What Are Computers (If They’re not Thinking Things)?
- Valuation semantics for first-order logics of evidence and truth
- Belnap-Dunn Semantics for the Variants of BN4 and E4 which Contain Routley and Meyer’s Logic B
- On dynamically non-trivial three-valued logics: Oscillatory and bifurcatory species
- Exploiting uncertainty for querying inconsistent description logics knowledge bases
- First-order logics of evidence and truth with constant and variable domains
- Qualitative reasoning in a two-layered framework
- Two-layered logics for paraconsistent probabilities
- Some remarks on two seminal approaches to paraconsistency: Stanisław Jaśkowski and Newton da Costa
This page was built for publication: How a Computer Should Think
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305607)
