The limits of E-recursive enumerability

DOI10.1016/0168-0072(86)90064-3zbMATH Open0632.03040OpenAlexW2001479798MaRDI QIDQ1095136FDOQ1095136

Authors: Gerald E. Sacks 

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90064-3

Recommendations

• Reflection and forcing in E-recursion theory
• scientific article; zbMATH DE number 3916251
• \(E\)-recursion 2012
• Effective cofinalities and admissibility in E-recursion
• \(E\)-recursive intuitions

zbMATH Keywords

E-recursion theory

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Aspects of constructibility
• Negative solutions to Post's problem. II
• Completely mitotic r. e. degrees
• Recursive Functionals and Quantifiers of Finite Types II
• Uncountable admissibles. II: Compactness
• Σ₁ compactness for next admissible sets
• Title not available (Why is that?)
• Reflection and forcing in E-recursion theory
• Inadmissible forcing
• Effective cofinalities and admissibility in E-recursion
• The K-Section of a Type n Object
• Hyperanalytic Predicates
• The extended plus-one hypothesis—A relative consistency result
• Title not available (Why is that?)
• The definability of E(α)
• Title not available (Why is that?)
• Degrees of unsolvability of constructible sets of integers

Cited In (8)

• Another extension of Van de Wiele's theorem
• Effective cofinalities and admissibility in E-recursion
• SOME CONSEQUENCES OF AD FOR KLEENE RECURSION IN3E
• Effective forcing versus proper forcing
• Title not available (Why is that?)
• Reflection and forcing in E-recursion theory
• Inadmissible forcing
• Title not available (Why is that?)

This page was built for publication: The limits of E-recursive enumerability

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