- 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
Countable structures of given age
Journal of Symbolic Logic 57 (3):992-1010 (1992)
Abstract
Let L be a finite relational language. The age of a structure M over L is the set of isomorphism types of finite substructures of M. We classify those ages U for which there are less than 2ω countably infinite pairwise nonisomorphic L-structures of age ULinks
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 automorphism groups of countable structures.Su Gao - 1998 - Journal of Symbolic Logic 63 (3):891-896.
Countable structures, Ehrenfeucht strategies, and wadge reductions.Tom Linton - 1991 - Journal of Symbolic Logic 56 (4):1325-1348.
Stable structures with few substructures.Michael C. Laskowski & Laura L. Mayer - 1996 - Journal of Symbolic Logic 61 (3):985-1005.
Modèles saturés et modèles engendrés Par Des indiscernables.Benoît Mariou - 2001 - Journal of Symbolic Logic 66 (1):325-348.
A note on countable complete theories having three isomorphism types of countable models.Robert E. Woodrow - 1976 - Journal of Symbolic Logic 41 (3):672-680.
Interpreting groups in ω-categorical structures.Dugald Macpherson - 1991 - Journal of Symbolic Logic 56 (4):1317-1324.
Binary relational structures having only countably many nonisomorphic substructures.Dugald Macpherson & James H. Schmerl - 1991 - Journal of Symbolic Logic 56 (3):876-884.
An algebraic result about soft model theoretical equivalence relations with an application to H. Friedman's fourth problem.Daniele Mundici - 1981 - Journal of Symbolic Logic 46 (3):523-530.
Relational structures determined by their finite induced substructures.I. M. Hodkinson & H. D. Macpherson - 1988 - Journal of Symbolic Logic 53 (1):222-230.
Analytics
Added to PP
2009-01-28
Downloads
40 (#387,619)
6 months
23 (#116,187)
2009-01-28
Downloads
40 (#387,619)
6 months
23 (#116,187)
Historical graph of downloads
Citations of this work
Counting Siblings in Universal Theories.Samuel Braunfeld & Michael C. Laskowski - 2022 - Journal of Symbolic Logic 87 (3):1130-1155.
Mutual algebraicity and cellularity.Samuel Braunfeld & Michael C. Laskowski - 2022 - Archive for Mathematical Logic 61 (5):841-857.
References found in this work
Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation.Maurice Pouzet - 1981 - Mathematical Logic Quarterly 27 (19-21):289-332.
Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation.Maurice Pouzet - 1981 - Mathematical Logic Quarterly 27 (19‐21):289-332.
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-pp8v9 uwo