A computably stable structure with no Scott family of finitary formulas

, &
Archive for Mathematical Logic 45 (5):519-538 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1007/s00153-005-0326-7

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

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

A computably categorical structure whose expansion by a constant has infinite computable dimension.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (4):1199-1241.
The Family of Stable Models.Melvin Fitting - unknown
The approximation structure of a computably approximable real.George Barmpalias - 2003 - Journal of Symbolic Logic 68 (3):885-922.
Categoricity transfer in simple finitary abstract elementary classes.Tapani Hyttinen & Meeri Kesälä - 2011 - Journal of Symbolic Logic 76 (3):759 - 806.
On the filter of computably enumerable supersets of an r-maximal set.Steffen Lempp, André Nies & D. Reed Solomon - 2001 - Archive for Mathematical Logic 40 (6):415-423.
Computably categorical structures and expansions by constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard A. Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
Computability in structures representing a Scott set.Alex M. McAllister - 2001 - Archive for Mathematical Logic 40 (3):147-165.
Safe formulas in the general theory of stable models (preliminary report).Vladimir Lifschitz - unknown
Safe Formulas in the General Theory of Stable Models (Preliminary Report).Joohyung Lee & Vladimir Lifschitz - unknown
Cohen-stable families of subsets of integers.Miloš S. Kurilić - 2001 - Journal of Symbolic Logic 66 (1):257-270.
Managerial life without a wife: Family structure and managerial career success. [REVIEW]Joy A. Schneer & Frieda Reitman - 2002 - Journal of Business Ethics 37 (1):25 - 38.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
Every incomplete computably enumerable truth-table degree is branching.Peter A. Fejer & Richard A. Shore - 2001 - Archive for Mathematical Logic 40 (2):113-123.
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.

Analytics

Added to PP
2013-11-23

Downloads
302 (#63,854)

6 months
10 (#219,185)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

[Introduction].Wilfrid Hodges - 1988 - Journal of Symbolic Logic 53 (1):1.
[Introduction].Wilfrid Hodges - 1986 - Journal of Symbolic Logic 51 (4):865.
Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.

View all 8 references / Add more references