Computing the maximal Boolean complexity of families of Aristotelian diagrams (Q4612443)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the maximal Boolean complexity of families of Aristotelian diagrams |
scientific article; zbMATH DE number 7009557
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the maximal Boolean complexity of families of Aristotelian diagrams |
scientific article; zbMATH DE number 7009557 |
Statements
Computing the maximal Boolean complexity of families of Aristotelian diagrams (English)
0 references
31 January 2019
0 references
Aristotelian diagram
0 references
logical geometry
0 references
bitstring semantics
0 references
Aristotelian family
0 references
Boolean subfamily
0 references
logic programming
0 references
