On constructive models of theories with linear Rudin-Keisler ordering

MaRDI QIDQ2885296zbMATH OpenFDO

Authors Alexander Gavryushkin

Publication date 21 May 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

zbMATH Keywords

countable modelRudin-Keisler quasiorder

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Recommendations

• On constructive models of theories with linear Rudin-Keisler ordering
• Complete theories with finitely many countable models. II
• Spectra of computable models for Ehrenfeucht theories
• A new spectrum of computable models
• On the number of countable models of complete theories with finite Rudin-Keisler preorders

Cited in

(7)

• Autostability of prime models under strong constructivizations
• Destructibility and axiomatizability of Kaufmann models
• The model-theoretic ordinal analysis of theories of predicative strength
• Complete theories with finitely many countable models. II
• Models of \textsf{ZFA} in which every linearly ordered set can be well ordered
• The classification of the countable models of complete theories of unary predicates with a substitution of a bounded order
• A generalization of the Keisler‐Morley theorem to recursively saturated ordered structures

This page was built for publication: On constructive models of theories with linear Rudin-Keisler ordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885296)