Enumeration Reducibility and Computable Structure Theory
- 1 December 2016
- book chapter
- Published by Springer Nature
- p. 271-301
Abstract
No abstract availableKeywords
This publication has 66 references indexed in Scilit:
- RELATIVE TO ANY NON-HYPERARITHMETIC SETJournal of Mathematical Logic, 2013
- Uniform regular enumerationsMathematical Structures in Computer Science, 2006
- Every Set has a Least Jump EnumerationJournal of the London Mathematical Society, 2000
- Non Σn axiomatizable almost strongly minimal theoriesThe Journal of Symbolic Logic, 1989
- Definability via enumerationsThe Journal of Symbolic Logic, 1989
- Degrees coded in jumps of orderingsThe Journal of Symbolic Logic, 1986
- Degrees of StructuresThe Journal of Symbolic Logic, 1981
- A note on the hyperarithmetical hierarchyThe Journal of Symbolic Logic, 1970
- Abstract Computability and Invariant DefinabilityThe Journal of Symbolic Logic, 1970
- Semirecursive sets and positive reducibilityTransactions of the American Mathematical Society, 1968