Degree spectra of the successor relation of computable linear orderings
type: Item
instance of: scholarly article
title: Degree spectra of the successor relation of computable linear orderings
zbMATH Open document ID: 1161.03022
author: J. Martínez
published in: Archive for Mathematical Logic
publication date: 2009-03-17T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 06A05
zbMATH DE Number: 5529374
zbMATH Keywords: computably enumerable Turing degree
zbMATH Keywords: upper cone
zbMATH Keywords: degree spectrum
zbMATH Keywords: successor relation
zbMATH Keywords: computable linear ordering
MaRDI profile type: Publication
full work available at URL: s00153-008-0110-6
OpenAlex ID: W2019414989
cites work: Computable structures and the hyperarithmetical hierarchy
cites work: Every recursive Boolean algebra is isomorphic to one with incomplete atoms
cites work: Q4451642
cites work: Recursive Linear Orders with Incomplete Successivities
cites work: Autostability of models
cites work: Some effects of Ash-Nerode and other decidability conditions on degree spectra
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Q3949052
cites work: Recursive isomorphism types of recursive Boolean algebras
cites work: Recursively Categorical Linear Orderings
cites work: Q4040892
DOI: 10.1007/S00153-008-0110-6
Recommended article: Presentations of the successor relation of computable linear ordering
Recommended article: ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
Recommended article: COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
Recommended article: Degree Spectra of Relations on Computable Structures
Recommended article: Degree spectra of relations on structures of finite computable dimension
Recommended article: A note on \(\Delta_2^0\)-spectra of linear orderings and degree spectra of the successor relation
Recommended article: Computable linear orders and the Ershov hierarchy
Recommended article: Computable linear orders and the ershov hierarchy
Recommended article: Computable linearizations of well-partial-orderings
Recommended article: Computability-theoretic and proof-theoretic aspects of partial and linear orderings
description: scientific article; zbMATH DE number 5529374