Finite condensations of recursive linear orders

&
Studia Logica 47 (4):311 - 317 (1988)
  Copy   BIBTEX

Abstract

The complexity of aII 4 set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can beII 2–II 1. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely many times.

Categories

Keywords

Reprint years

DOI

10.1007/bf00671562

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
Non-primitive recursive decidability of products of modal logics with expanding domains.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2006 - Annals of Pure and Applied Logic 142 (1):245-268.
Bounded contraction and Gentzen-style formulation of łukasiewicz logics.Andreja Prijatelj - 1996 - Studia Logica 57 (2-3):437 - 456.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
On Fraïssé’s conjecture for linear orders of finite Hausdorff rank.Alberto Marcone & Antonio Montalbán - 2009 - Annals of Pure and Applied Logic 160 (3):355-367.
Complexity of monodic guarded fragments over linear and real time.Ian Hodkinson - 2006 - Annals of Pure and Applied Logic 138 (1):94-125.
The complexity of continuous embeddability between dendrites.Alberto Marcone & Christian Rosendal - 2004 - Journal of Symbolic Logic 69 (3):663-673.
Polynomial-time abelian groups.Douglas Cenzer & Jeffrey Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):313-363.
On finite rigid structures.Yuri Gurevich & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (2):549-562.
Elementary Properties of the Finite Ranks.Anuj Dawar, Kees Doets, Steven Lindell & Scott Weinstein - 1998 - Mathematical Logic Quarterly 44 (3):349-353.

Analytics

Added to PP
2009-01-28

Downloads
5 (#1,562,871)

6 months
34 (#104,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
R. e. presented linear orders.Dev Kumar Roy - 1983 - Journal of Symbolic Logic 48 (2):369-376.
Linear Order Types of Nonrecursive Presentability.Dev Kumar Roy - 1985 - Mathematical Logic Quarterly 31 (31-34):495-501.
Linear Order Types of Nonrecursive Presentability.Dev Kumar Roy - 1985 - Mathematical Logic Quarterly 31 (31-34):495-501.

Add more references