You're using an ancient browser to surf the modern web. Please update to the latest version (and don't use Internet Explorer!).

Leonardi.DB
a logical geometry project

Computing the maximal Boolean complexity of families of Aristotelian diagrams (2018)

Journal
Journal of Logic and Computation, vol. 28, issue 6, pp. 1323–1339
Language
English
↑ Back to top ↑