Saturated models and models generated by indiscernibles

Journal of Symbolic Logic 66 (1):325-348 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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

Automorphisms of Saturated and Boundedly Saturated Models of Arithmetic.Ermek S. Nurkhaidarov & Erez Shochat - 2011 - Notre Dame Journal of Formal Logic 52 (3):315-329.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Recursively saturated models generated by indiscernibles.James H. Schmerl - 1985 - Notre Dame Journal of Formal Logic 26 (2):99-105.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Saturated models in institutions.Răzvan Diaconescu & Marius Petria - 2010 - Archive for Mathematical Logic 49 (6):693-723.
Remarks on Structure Theorems for -Saturated Models.Tapani Hyttinen - 1995 - Notre Dame Journal of Formal Logic 36 (2):269-278.
Models with the ω-property.Roman Kossak - 1989 - Journal of Symbolic Logic 54 (1):177-189.
Properties of Saturation in Monotonic Neighbourhood Models and Some Applications.Sergio A. Celani - 2015 - Studia Logica 103 (4):733-755.
Elementary Cuts in Saturated Models of Peano Arithmetic.James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (1):1-13.
Large resplendent models generated by indiscernibles.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (4):1382-1388.
Arithmetically Saturated Models of Arithmetic.Roman Kossak & James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):531-546.
1-based theories — the main gap for a -models.B. Hart, A. Pillay & S. Starchenko - 1995 - Archive for Mathematical Logic 34 (5):285-300.
Binary models generated by their tally part.Fernando Ferreira - 1994 - Archive for Mathematical Logic 33 (4):283-289.
Automorphisms of Countable Recursively Saturated Models of PA: A Survey.Henryk Kotlarski - 1995 - Notre Dame Journal of Formal Logic 36 (4):505-518.

Analytics

Added to PP
2014-03-25

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references