- 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
On Interpretability of Almost Linear Orderings
Notre Dame Journal of Formal Logic 39 (3):325-331 (1998)
Abstract
In this paper we define the notion of -linearity for and discuss interpretability (and noninterpretability) of -linear orders in structures and theoriesLinks
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
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Provability and Interpretability Logics with Restricted Realizations.Thomas F. Icard & Joost J. Joosten - 2012 - Notre Dame Journal of Formal Logic 53 (2):133-154.
Notions of relative ubiquity for invariant sets of relational structures.Paul Bankston & Wim Ruitenburg - 1990 - Journal of Symbolic Logic 55 (3):948-986.
On the equimorphism types of linear orderings.Antonio Montalbán - 2007 - Bulletin of Symbolic Logic 13 (1):71-99.
A generalization of tennenbaum's theorem on effectively finite recursive linear orderings.Richard Watnick - 1984 - Journal of Symbolic Logic 49 (2):563-569.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Analytics
Added to PP
2010-08-24
Downloads
15 (#893,994)
6 months
3 (#902,269)
2010-08-24
Downloads
15 (#893,994)
6 months
3 (#902,269)
Historical graph of downloads
References found in this work
On Theories Having Three Countable Models.Koichiro Ikeda, Akito Tsuboi & Anand Pillay - 1998 - Mathematical Logic Quarterly 44 (2):161-166.
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-6d9b7f7c4c-tstkh uwo