Degrees of relative provability (Q691125): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2054442457 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Subrecursive Hierarchy and Primitive Recursive Degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4215630 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementary Embeddings and Algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4215632 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Accessible Independence Results for Peano Arithmetic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extension of an effectively generated class of functions by enumeration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A jump operator on honest subrecursive degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4503966 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4215633 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 23:08, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Degrees of relative provability |
scientific article |
Statements
Degrees of relative provability (English)
0 references
29 November 2012
0 references
The aim of the paper is to study the provability strength of the totality of recursive functions by investigating the degree structure induced by the relative provability order of recursive algorithms. Several results about the proof-theoretic degree structure are presented. Recursion-theoretic techniques -- e.g., diagonalization and recursion theorem -- are used. Some ideas from a new viewpoint are provided.
0 references
degree structure
0 references
provability strength
0 references
totality of recursive functions
0 references
relative provability order of recursive algorithms
0 references