scientific article; zbMATH DE number 3981159

zbMATH Open0607.03012MaRDI QIDQ3745832FDOQ3745832

Authors: Gerald E. Sacks 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• The limits of E-recursive enumerability
• Post’s Problem for Ordinal Register Machines
• scientific article; zbMATH DE number 1390020
• scientific article; zbMATH DE number 3948239
• scientific article; zbMATH DE number 1747699
• \(E\)-recursive intuitions
• Postorder trees and Eulerian numbers
• Post's problem for ordinal register machines: an explicit approach
• The exact complexity of the infinite Post Correspondence Problem

zbMATH Keywords

construction of two incomparable r.e. setsfine structure and reflection propertiesFriedberg-Muchnik requirementpartial E-recursive functions

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Inner models, including constructibility, ordinal definability, and core models (03E45)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

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