PA RELATIVE TO AN ENUMERATION ORACLE

DOI10.1017/JSL.2022.55MaRDI QIDQ6180605zbMATH OpenOpenAlexFDO

Authors Jun Le Goh, Iskander Kalimullin, Joseph S. Miller, Mariya I. Soskova

Publication date 22 December 2023

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/jsl.2022.55

zbMATH Keywords

enumeration degreesPA relative toseparating classes

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Algorithmic randomness and dimension (03D32)

Recommendations

• On relative enumerability of Turing degrees
• scientific article; zbMATH DE number 4008384
• A structural dichotomy in the enumeration degrees
• Bounded enumeration reducibility and its degree structure
• Embedding countable partial orderings in the enumeration degrees and the -enumeration degrees

Cites work

• A structural dichotomy in the enumeration degrees
• Algorithmic Randomness of Closed Sets
• An application of 1-genericity in the ^0_2 enumeration degrees
• Arithmetical Reducibilities I
• Characterizing the continuous degrees
• Cototal enumeration degrees and their applications to effective mathematics
• Creative sets
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Defining totality in the enumeration degrees
• Degrees of unsolvability of continuous functions
• Density of the cototal enumeration degrees
• Enumeration 1-genericity in the local enumeration degrees
• Enumeration reducibility in closure spaces with applications to logic and algebra
• scientific article; zbMATH DE number 7092101 (Why is no real title available?)
• scientific article; zbMATH DE number 3110189 (Why is no real title available?)
• scientific article; zbMATH DE number 3110190 (Why is no real title available?)
• Martin-Löf randomness and Galton-Watson processes
• Measures and their random reals
• On cototality and the skip operator in the enumeration degrees
• On principles of computability on admissible sets
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Recursion theory week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984
• Reducibility and Completeness for Sets of Integers
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(1)

• ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?

This page was built for publication: PA RELATIVE TO AN ENUMERATION ORACLE

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