Decidable models of ω-stable theories

Journal of Symbolic Logic 79 (1):186-192 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2013.2

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,934

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Expansions of models of ω-stable theories.Steven Buechler - 1984 - Journal of Symbolic Logic 49 (2):470-477.
Dependence logic in pregeometries and ω-stable theories.Gianluca Paolini & Jouko Väänänen - 2016 - Journal of Symbolic Logic 81 (1):32-55.
An Old Friend Revisited: Countable Models of ω-Stable Theories.Michael C. Laskowski - 2007 - Notre Dame Journal of Formal Logic 48 (1):133-141.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
Weight ω in stable theories with few types.Bernhard Herwig - 1995 - Journal of Symbolic Logic 60 (2):353-373.
The Morley rank of a Banach space.Jose Iovino - 1996 - Journal of Symbolic Logic 61 (3):928-941.
Regular types in nonmultidimensional ω-stable theories.Anand Pillay - 1984 - Journal of Symbolic Logic 49 (3):880-891.
First-order and counting theories of ω-automatic structures.Dietrich Kuske & Markus Lohrey - 2008 - Journal of Symbolic Logic 73 (1):129-150.
Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740. [REVIEW]Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.

Analytics

Added to PP
2016-06-30

Downloads
11 (#1,433,119)

6 months
4 (#1,288,968)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references