- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Large resplendent models generated by indiscernibles
Journal of Symbolic Logic 54 (4):1382-1388 (1989)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On some putative graph-theoretic counterexamples to the Principle of the Identity of Indiscernibles.Rafael De Clercq - 2012 - Synthese 187 (2):661-672.
Recursively saturated models generated by indiscernibles.James H. Schmerl - 1985 - Notre Dame Journal of Formal Logic 26 (2):99-105.
Expansions of models of ω-stable theories.Steven Buechler - 1984 - Journal of Symbolic Logic 49 (2):470-477.
Saturation of homogeneous resplendent models.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (1):222-224.
An introduction to recursively saturated and resplendent models.Jon Barwise & John Schlipf - 1976 - Journal of Symbolic Logic 41 (2):531-536.
The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Indiscernibles and decidable models.H. A. Kierstead & J. B. Remmel - 1983 - Journal of Symbolic Logic 48 (1):21-32.
Two spheres, twenty spheres, and the identity of indiscernibles.Michael Della Rocca - 2005 - Pacific Philosophical Quarterly 86 (4):480–492.
Analytics
Added to PP
2009-01-28
Downloads
118 (#146,865)
6 months
7 (#350,235)
2009-01-28
Downloads
118 (#146,865)
6 months
7 (#350,235)
Historical graph of downloads
Citations of this work
Resplendent models and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_1^1}$$\end{document} -definability with an oracle. [REVIEW]Andrey Bovykin - 2008 - Archive for Mathematical Logic 47 (6):607-623.
References found in this work
Recursively saturated models generated by indiscernibles.James H. Schmerl - 1985 - Notre Dame Journal of Formal Logic 26 (2):99-105.
A guide to the identification of admissible sets above structures.John S. Schlipf - 1977 - Annals of Mathematical Logic 12 (2):151.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo