- 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
Countably categorical coloured linear orders
Mathematical Logic Quarterly 56 (2):159-163 (2010)
Abstract
In this paper, we give a classification of ℵ0-categorical coloured linear orders, generalizing Rosenstein's characterization of ℵ0-categorical linear orderings. We show that they can all be built from coloured singletons by concatenation and ℚn-combinations . We give a method using coding trees to describe all structures in our listOther Versions
No versions found
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
Approximating trees as coloured linear orders and complete axiomatisations of some classes of trees.Ruaan Kellerman & Valentin Goranko - 2021 - Journal of Symbolic Logic 86 (3):1035-1065.
Scott Sentence Complexities of Linear Orderings.David Gonzalez & Dino Rossegger - forthcoming - Journal of Symbolic Logic:1-30.
On Interpretability of Almost Linear Orderings.Akito Tsuboi & Kentaro Wakai - 1998 - Notre Dame Journal of Formal Logic 39 (3):325-331.
Adding linear orders.Saharon Shelah & Pierre Simon - 2012 - Journal of Symbolic Logic 77 (2):717-725.
A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
Degree spectra of relations on computable structures in the presence of Δ 2 0 isomorphisms.Denis R. Hirschfeldt - 2002 - Journal of Symbolic Logic 67 (2):697-720.
The forth part of the back and forth map in countable homogeneous structures.S. J. Mcleish - 1997 - Journal of Symbolic Logic 62 (3):873-890.
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
A coding of the countable linear orderings.Patrick Dehornoy - 1990 - Studia Logica 49 (4):585 - 590.
Analytics
Added to PP
2013-12-01
Downloads
30 (#749,901)
6 months
4 (#1,247,093)
2013-12-01
Downloads
30 (#749,901)
6 months
4 (#1,247,093)
Historical graph of downloads
Citations of this work
The complexity of isomorphism for complete theories of linear orders with unary predicates.Richard Rast - 2017 - Archive for Mathematical Logic 56 (3-4):289-307.
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-559df78dcc-ppxv8 uwo