Degrees of unsolvability associated with classes of formalized theories

DOI10.2307/2964178MaRDI QIDQ3243263zbMATH OpenOpenAlexFDO

Authors 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

FoundationsMathematical LogicPhilosophy

Cites work

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

Cited in

(11)

• m-degrees of the word problem
• Representability op recursively enumerable sets in formal theories
• Theory spectra and classes of theories
• α-degrees of α-theories
• Computational processes, observers and Turing incompleteness
• Turing Jumps Through Provability
• Recursively enumerable sets and degrees
• Myhill's work in recursion theory
• Degrees of formal systems
• Pour-El's landscape
• Finding the limit of incompleteness. I

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

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