Computing degrees of unsolvability
type: Item
instance of: scholarly article
title: Computing degrees of unsolvability
zbMATH Open document ID: 0086.01101
DOI: 10.1007/BF01342939
author: Hartley jun. Rogers
published in: Mathematische Annalen
publication date: 1959-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/160704
zbMATH DE Number: 3140510
zbMATH Keywords: philosophy and foundations of mathematics
MaRDI profile type: Publication
cites work: Recursive Predicates and Quantifiers
cites work: On definable sets of positive integers
cites work: Recursively enumerable sets of positive integers and their decision problems
cites work: The upper semi-lattice of degrees of recursive unsolvability
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
cites work: Examples of sets definable by means of two and three quantifiers
cites work: Arithmetical representation of recursively enumerable sets
cites work: Q3247126
cites work: Gödel numberings of partial recursive functions
cites work: Reducibility and Completeness for Sets of Integers
cites work: Creative sets
cites work: On degrees of recursive unsolvability
cites work: Degrees of Computability
cites work: A Theorem on Hypersimple Sets
OpenAlex ID: W2913148016
description: scientific article; zbMATH DE number 3140510