Semi-honest subrecursive degrees and the collection rule in arithmetic
From MaRDI portal
Publication:6137350
Recommendations
Cites work
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- A Classification of the Recursive Functions
- A jump operator on honest subrecursive degrees
- A proof-theoretic analysis of collection
- Augmented loop languages and classes of computable functions
- Classical recursion theory. The theory of functions and sets of natural numbers
- Computer Science Logic
- Degrees of relative provability
- Degrees of total algorithms versus degrees of honest functions
- Envelopes, indicators and conservativeness
- Existentially closed structures and Gödel's second incompleteness theorem
- Fragments of Arithmetic and true sentences
- Induction rules, reflection principles, and provably recursive functions
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
- On the density of honest subrecursive classes
- On the induction schema for decidable predicates
- On the structure of subrecursive degrees
- Provability algebras and proof-theoretic ordinals. I
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- Reflection principles and provability algebras in formal arithmetic
- Saturated models of universal theories
- Streamlined subrecursive degree theory
- Subrecursive degrees and fragments of Peano arithmetic
- The honest subrecursive classes are a lattice
This page was built for publication: Semi-honest subrecursive degrees and the collection rule in arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137350)
