|
This article is cited in 1 scientific paper (total in 1 paper)
Countably categorical theories
V. G. Puzarenkoab a Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
A series of countably categorical theories are constructed based on the Fraisse method. In particular, an example of a decidable countably categorical theory of finite signature is given for which no decidable model has an infinite computable set of order-indiscernible elements. Such a theory is used to refute Ershov's conjecture on the representability of models of $c$-simple theories over linear orders.
Keywords:
countably categorical theory, Fraisse method, decidable theory, decidable model, linear order.
Received: 20.04.2011 Revised: 18.01.2012
Citation:
V. G. Puzarenko, “Countably categorical theories”, Algebra Logika, 51:3 (2012), 358–384; Algebra and Logic, 51:3 (2012), 241–258
Linking options:
https://www.mathnet.ru/eng/al540 https://www.mathnet.ru/eng/al/v51/i3/p358
|
Statistics & downloads: |
Abstract page: | 320 | Full-text PDF : | 136 | References: | 48 | First page: | 11 |
|