- 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
Decidable discrete linear orders
Journal of Symbolic Logic 53 (2):531-539 (1988)
Abstract
Three classes of decidable discrete linear orders with varying degrees of effectiveness are investigated. We consider how a classical order type may lie in relation to these three classes, and we characterize by their order types elements of these classes that have effective nontrivial self-embeddingsLinks
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
Logical Consecutions in Discrete Linear Temporal Logic.V. V. Rybakov - 2005 - Journal of Symbolic Logic 70 (4):1137 - 1149.
On the quasi-ordering of borel linear orders under embeddability.Alain Louveau & Jean Saint-Raymond - 1990 - Journal of Symbolic Logic 55 (2):537-560.
On the membership problem for non-linear abstract categorial grammars.Sylvain Salvati - 2010 - Journal of Logic, Language and Information 19 (2):163-183.
An Undecidable Linear Order That Is $n$-Decidable for All $n$.John Chisholm & Michael Moses - 1998 - Notre Dame Journal of Formal Logic 39 (4):519-526.
Finite condensations of recursive linear orders.Dev K. Roy & Richard Watnick - 1988 - Studia Logica 47 (4):311 - 317.
Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.
The undecidability of second order linear logic without exponentials.Yves Lafont - 1996 - Journal of Symbolic Logic 61 (2):541-548.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
Analytics
Added to PP
2009-01-28
Downloads
40 (#389,966)
6 months
4 (#800,606)
2009-01-28
Downloads
40 (#389,966)
6 months
4 (#800,606)
Historical graph of downloads
Citations of this work
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
References found in this work
Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
Relations Intrinsically Recursive in Linear Orders.Michael Moses - 1986 - Mathematical Logic Quarterly 32 (25‐30):467-472.
Relations Intrinsically Recursive in Linear Orders.Michael Moses - 1986 - Mathematical Logic Quarterly 32 (25-30):467-472.
Elementary recursive quantifier elimination based on Thom encoding and sign determination.Daniel Perrucci & Marie-Françoise Roy - 2017 - Annals of Pure and Applied Logic 168 (8):1588-1604.
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-l2pxr uwo