- 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
Complexity Ranks of Countable Models
Notre Dame Journal of Formal Logic 48 (1):33-48 (2007)
Abstract
We define some variations of the Scott rank for countable models and obtain some inequalities involving the ranks. For mono-unary algebras we prove that the game rank of any subtree does not exceed the game rank of the whole model. However, similar questions about linear orders remain unresolvedLinks
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
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
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.
End extensions and numbers of countable models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):550-562.
On countable simple unidimensional theories.Anand Pillay - 2003 - Journal of Symbolic Logic 68 (4):1377-1384.
Order types of ordinals in models of set theory.John E. Hutchinson - 1976 - Journal of Symbolic Logic 41 (2):489-502.
On automorphism groups of countable structures.Su Gao - 1998 - Journal of Symbolic Logic 63 (3):891-896.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Locally countable models of Σ1-separation.Fred G. Abramson - 1981 - Journal of Symbolic Logic 46 (1):96 - 100.
Rich models.Michael H. Albert & Rami P. Grossberg - 1990 - Journal of Symbolic Logic 55 (3):1292-1298.
Analytics
Added to PP
2010-08-24
Downloads
53 (#300,630)
6 months
13 (#194,369)
2010-08-24
Downloads
53 (#300,630)
6 months
13 (#194,369)
Historical graph of downloads
Citations of this work
An introduction to the Scott complexity of countable structures and a survey of recent results.Matthew Harrison-Trainor - 2022 - Bulletin of Symbolic Logic 28 (1):71-103.
References found in this work
A complete L ω1ω-sentence characterizing ℵ1.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):59-62.
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Some Dichotomy Theorems for Isomorphism Relations of Countable Models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
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-64dd777598-zf4z4 uwo