"The complexity of predicate default logic over a countable domain."

Robert Saxon Milnikel (2003)

> Home

Details and statistics

DOI: 10.1016/S0168-0072(02)00064-7

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/apal/Milnikel03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apal/Milnikel03
Robert Saxon Milnikel:
The complexity of predicate default logic over a countable domain. Ann. Pure Appl. Log. 120(1-3): 151-163 (2003)

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.