"Computing the maximal Boolean complexity of families of Aristotelian diagrams."

Lorenz Demey (2018)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/EXY015

access: closed

type: Journal Article

metadata version: 2018-09-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/Demey18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/Demey18
Lorenz Demey:
Computing the maximal Boolean complexity of families of Aristotelian diagrams. J. Log. Comput. 28(6): 1323-1339 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.