Pages that link to "Item:Q4612443"
From MaRDI portal
The following pages link to Computing the maximal Boolean complexity of families of Aristotelian diagrams (Q4612443):
Displaying 13 items.
- Geometric and cognitive differences between logical diagrams for the Boolean algebra \(\mathbb {B}_{4}\) (Q723644) (← links)
- The interaction between logic and geometry in Aristotelian diagrams (Q1664368) (← links)
- Combinatorial bitstring semantics for arbitrary logical fragments (Q1749808) (← links)
- Logical and geometrical distance in polyhedral Aristotelian diagrams in knowledge representation (Q2333411) (← links)
- Schopenhauer's partition diagrams and logical geometry (Q2671595) (← links)
- Aristotelian diagrams for semantic and syntactic consequence (Q2690166) (← links)
- From Euler Diagrams in Schopenhauer to Aristotelian Diagrams in Logical Geometry (Q5118391) (← links)
- Boolean considerations on John Buridan's octagons of opposition (Q5208117) (← links)
- Between Square and Hexagon in Oresme's <i>Livre du Ciel et du Monde</i> (Q5871283) (← links)
- Logic-sensitivity and bitstring semantics in the square of opposition (Q6145033) (← links)
- Augustus De Morgan's unpublished octagon of opposition (Q6600388) (← links)
- Morphisms between Aristotelian diagrams (Q6621367) (← links)
- Aristotelian and Boolean properties of the Keynes-Johnson octagon of opposition (Q6623814) (← links)
