"The complexity of countable categoricity in finite languages."

Aleksander Ivanov (2012)

> Home

Details and statistics

DOI: 10.1002/MALQ.201110035

access: closed

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mlq/Ivanov12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mlq/Ivanov12
Aleksander Ivanov:
The complexity of countable categoricity in finite languages. Math. Log. Q. 58(1-2): 105-112 (2012)

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.