The relationship between local and global structure in the enumeration degrees

DOI10.1007/978-3-031-36978-0_2OpenAlexW4384788418MaRDI QIDQ6149026

Mariya Ivanova Soskova

Publication date: 12 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-36978-0_2

zbMATH Keywords

definabilityenumeration degreesautomorphism base

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Definability in the Turing degrees
• First-order theory of the degrees of recursive unsolvability
• Definability in the enumeration degrees
• Definability in the Recursively Enumerable Degrees
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Reducibility and Completeness for Sets of Integers
• The Theory of the Degrees below 0 ′
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• The $\Delta ^0_2$ Turing degrees: Automorphisms and Definability
• The enumeration degrees: Local and global structural interactions
• Arithmetical Reducibilities I
• Defining totality in the enumeration degrees

This page was built for publication: The relationship between local and global structure in the enumeration degrees