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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

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

S. S. Goncharov. Autostability and computable families of constructivizations. Algebra and Logic, vol. 14 (1975), no. 6, pp. 392–409. - S. S. Goncharov. The quantity of nonautoequivalent constructivizations. Algebra and Logic, vol. 16 (1977), no. 3, pp. 169–185. - S. S. Goncharov and V. D. Dzgoev. Autostability of models. Algebra and Logic, vol. 19 (1980), no. 1, pp. 28–37. - J. B. Remmel. Recursively categorical linear orderings. Proceedings of the American Mathematical Society, vol. 83 (1981), no. 2, pp. 387–391. - Terrence Millar. Recursive categoricity and persistence. The Journal of Symbolic Logic, vol. 51 (1986), no. 2, pp. 430–434. - Peter Cholak, Segey Goncharov, Bakhadyr Khoussainov and Richard A. Shore. Computably categorical structures and expansions by constants. The Journal of Symbolic Logic, vol. 64 (1999), no. 1, pp. 13–137. - Peter Cholak, Richard A. Shore and Reed Solomon. A computably stable structure with no Scott family of finitary formulas. Archive for Mathematical. [REVIEW]Daniel Turetsky - 2012 - Bulletin of Symbolic Logic 18 (1):131-134.
Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.
Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.
Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.
Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.
Erratum: “Forcing and antifoundation”. [REVIEW]Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):663-663.
Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Well-foundedness in Realizability.M. Hofmann, J. Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.
Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.

Analytics

Added to PP
2013-11-23

Downloads
308 (#89,677)

6 months
2 (#1,685,557)

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.
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 6 references / Add more references