The complexity of countable categoricity in finite languages (Q3117785): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(7 intermediate revisions by 6 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1002/malq.201110035 / rank | |||
Property / author | |||
Property / author: Alexandre A. Ivanov / rank | |||
Property / author | |||
Property / author: Alexandre A. Ivanov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1969902453 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1101.3792 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: GALOIS GROUPS OF FIRST ORDER THEORIES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On many-sorted ω-categorical theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A countably categorical theory which is not \(G\)-compact / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generic structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The diameter of a Lascar strong type / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A decidable Ehrenfeucht theory with exactly two hyperarithmetic models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1002/MALQ.201110035 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:20, 20 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of countable categoricity in finite languages |
scientific article |
Statements
The complexity of countable categoricity in finite languages (English)
0 references
29 February 2012
0 references
countable categoricity
0 references
index sets
0 references
Ehrenfeucht theories
0 references