Post's problem without admissibility
type: Item
instance of: scholarly article
title: Post's problem without admissibility
zbMATH Open document ID: 0453.03046
DOI: 10.1016/0001-8708(80)90042-0
published in: Advances in Mathematics
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D60
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03E99
zbMATH DE Number: 3708379
zbMATH Keywords: admissible and inadmissible ordinals
zbMATH Keywords: stationary sets
zbMATH Keywords: beta-recursion
zbMATH Keywords: beta recursively enumerable degrees
zbMATH Keywords: diamond
author: Sy-David Friedman
MaRDI profile type: Publication
full work available at URL: 0001-8708(80)90042-0
OpenAlex ID: W2002453609
cites work: Aspects of constructibility
cites work: Inadmissible recursion theory
cites work: The fine structure of the constructible hierarchy
cites work: Metarecursive sets
cites work: Q3232283
cites work: Post's Problem, Admissible Ordinals, and Regularity
cites work: The α-finite injury method
cites work: Σn sets which are Δn-incomparable (uniformly)
cites work: Q4081223
description: scientific article; zbMATH DE number 3708379