Degrees of unsolvability associated with classes of formalized theories

DOI10.2307/2964178zbMath0078.00603OpenAlexW2135002906MaRDI QIDQ3243263

Solomon Feferman

Publication date: 1957

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2964178

zbMATH Keywords

PhilosophyFoundationsMathematical Logic

Related Items (10)

Turing Jumps Through Provability ⋮ Computational processes, observers and Turing incompleteness ⋮ m-degrees of the word problem ⋮ Degrees of formal systems ⋮ α-degrees of α-theories ⋮ Myhill's work in recursion theory ⋮ Representability op recursively enumerable sets in formal theories ⋮ Recursively enumerable sets and degrees ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Theory spectra and classes of theories

Cites Work

• Recursively enumerable sets of positive integers and their decision problems
• Creative sets

This page was built for publication: Degrees of unsolvability associated with classes of formalized theories