Computing the maximal Boolean complexity of families of Aristotelian diagrams

DOI10.1093/LOGCOM/EXY015zbMath1444.03112OpenAlexW2804436922MaRDI QIDQ4612443

Lorenz Demey

Publication date: 31 January 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/622052

zbMATH Keywords

logic programminglogical geometryAristotelian diagrambitstring semanticsAristotelian familyBoolean subfamily

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Logic programming (68N17)

Related Items (7)

Schopenhauer's partition diagrams and logical geometry ⋮ From Euler diagrams to Aristotelian diagrams ⋮ Logic-sensitivity and bitstring semantics in the square of opposition ⋮ Aristotelian diagrams for semantic and syntactic consequence ⋮ From Euler Diagrams in Schopenhauer to Aristotelian Diagrams in Logical Geometry ⋮ Boolean considerations on John Buridan's octagons of opposition ⋮ Between Square and Hexagon in Oresme's Livre du Ciel et du Monde

This page was built for publication: Computing the maximal Boolean complexity of families of Aristotelian diagrams