Partial n1- homogeneity of the countable saturated model of an n1 -categorical theory

Mathematical Logic Quarterly 21 (1):307-308 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19750210136

Links

PhilArchive



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

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

Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Modèles saturés et modèles engendrés Par Des indiscernables.Benoît Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.Denis R. Hirschfeldt, Bakhadyr Khoussainov & Pavel Semukhin - 2006 - Notre Dame Journal of Formal Logic 47 (1):63-71.
Generic Expansions of Countable Models.Silvia Barbina & Domenico Zambella - 2012 - Notre Dame Journal of Formal Logic 53 (4):511-523.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Applications of Kolmogorov Complexity to Computable Model Theory.B. Khoussainov, P. Semukhin & F. Stephan - 2007 - Journal of Symbolic Logic 72 (3):1041 - 1054.
Resplendent models and $${\Sigma_1^1}$$ -definability with an oracle.Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
On interstices of countable arithmetically saturated models of Peano arithmetic.Nicholas Bamber & Henryk Kotlarski - 1997 - Mathematical Logic Quarterly 43 (4):525-540.
Saturated models in institutions.Răzvan Diaconescu & Marius Petria - 2010 - Archive for Mathematical Logic 49 (6):693-723.
Automorphisms moving all non-algebraic points and an application to NF.Friederike Körner - 1998 - Journal of Symbolic Logic 63 (3):815-830.
A generalization of the Keisler-Morley theorem to recursively saturated ordered structures.Shahram Mohsenipour - 2007 - Mathematical Logic Quarterly 53 (3):289-294.
A Silver-like Perfect Set Theorem with an Application to Borel Model Theory.Joël Combase - 2011 - Notre Dame Journal of Formal Logic 52 (4):415-429.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts.Henryk Kotlarski & Bozena Piekart - 1995 - Mathematical Logic Quarterly 41 (1):138-142.

Analytics

Added to PP
2013-11-24

Downloads
6 (#1,434,892)

6 months
3 (#1,002,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Saturated model theory.Gerald E. Sacks - 1972 - Reading, Mass.,: W. A. Benjamin.
On strongly minimal sets.J. T. Baldwin & A. H. Lachlan - 1971 - Journal of Symbolic Logic 36 (1):79-96.

Add more references