The complexity of countable categoricity in finite languages (Q3117785): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 22:22, 4 July 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