Translator Disclaimer
2006 An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated
Bakhadyr Khoussainov, Denis R. Hirschfeldt, Pavel Semukhin
Notre Dame J. Formal Logic 47(1): 63-71 (2006). DOI: 10.1305/ndjfl/1143468311

Abstract

We build an א₁-categorical but not א₀-categorical theory whose only computably presentable model is the saturated one. As a tool, we introduce a notion related to limitwise monotonic functions.

Citation

Download Citation

Bakhadyr Khoussainov. Denis R. Hirschfeldt. Pavel Semukhin. "An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated." Notre Dame J. Formal Logic 47 (1) 63 - 71, 2006. https://doi.org/10.1305/ndjfl/1143468311

Information

Published: 2006
First available in Project Euclid: 27 March 2006

zbMATH: 1107.03032
MathSciNet: MR2211182
Digital Object Identifier: 10.1305/ndjfl/1143468311

Subjects:
Primary: 03045
Secondary: 03C57

Rights: Copyright © 2006 University of Notre Dame

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.47 • No. 1 • 2006
Back to Top