Enumerations of Turing ideals with applications

DOI10.1305/NDJFL/1093635587zbMATH Open0725.03027OpenAlexW1976099377MaRDI QIDQ2277253FDOQ2277253

Authors: David Marker 

Publication date: 1990

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093635587

Recommendations

• Upper bounds on ideals in the computably enumerable Turing degrees
• Completions of PA: Models and enumerations of representable sets
• Enumerations, countable structures and Turing degrees
• scientific article; zbMATH DE number 2144532
• Definability in the enumeration degrees

zbMATH Keywords

Turing reducibilityenumerationsmodel theory of first and second order arithmetical systemsTuring ideal

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (2)

• Direct construction of Scott ideals
• Title not available (Why is that?)

This page was built for publication: Enumerations of Turing ideals with applications

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