The following pages link to How a Computer Should Think (Q3305607):
Displaying 24 items.
- A calculus for four-valued sequential logic (Q549178) (← links)
- A strong and rich 4-valued modal logic without Łukasiewicz-type paradoxes (Q895828) (← links)
- On dynamically non-trivial three-valued logics: Oscillatory and bifurcatory species (Q1433787) (← links)
- Cut elimination, identity elimination, and interpolation in super-Belnap logics (Q1685571) (← 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)
- Paraconsistent Gödel modal logic (Q2104534) (← links)
- Constraint tableaux for two-dimensional fuzzy logics (Q2142061) (← links)
- Probabilities with gaps and gluts (Q2240549) (← links)
- Bilattice logic properly displayed (Q2328914) (← links)
- Structure of the rational monoid algebra for Boolean matrices of order 3 (Q2447975) (← links)
- What Are Computers (If They’re not Thinking Things)? (Q2904457) (← links)
- How We Think of Computing Today (Q3507474) (← links)
- (Q5020976) (← links)
- Belnap-Dunn Semantics for the Variants of BN4 and E4 which Contain Routley and Meyer’s Logic B (Q5066095) (← links)
- Preferences in discrete multi-adjoint formal concept analysis (Q6058291) (← links)
- Intuitionistic propositional probability logic (Q6094169) (← links)
- Qualitative reasoning in a two-layered framework (Q6099380) (← links)
- A postulate-driven study of logical argumentation (Q6136108) (← links)
- Toward updating belief functions over Belnap-Dunn logic (Q6160937) (← links)
- Presumptive Reasoning in a Paraconsistent Setting (Q6199612) (← links)
- Reasoning with belief functions over Belnap-Dunn logic (Q6560993) (← links)
- From Belnap-Dunn four-valued logic to six-valued logics of evidence and truth (Q6562366) (← links)
- A logical consequence informed by probability (Q6633057) (← links)
