scientific article; zbMATH DE number 2144532

zbMATH Open1076.03023MaRDI QIDQ4656805FDOQ4656805

Authors: Alex M. McAllister 

Publication date: 14 March 2005

Title of this publication is not available (Why is that?)

Recommendations

• Upper bounds on ideals in the computably enumerable Turing degrees
• Turing incomparability in Scott sets
• Defining the Turing jump
• DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
• A bounded jump for the bounded Turing degrees

zbMATH Keywords

relative computabilityarithmetical setsjump idealsTuring upper bounds

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Models of arithmetic and set theory (03C62) Undecidability and degrees of sets of sentences (03D35) Recursive equivalence types of sets and structures, isols (03D50)

Cited In (3)

• Direct construction of Scott ideals
• Turing incomparability in Scott sets
• Upper bounds on ideals in the computably enumerable Turing degrees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656805)