Semi-honest subrecursive degrees and the collection rule in arithmetic
From MaRDI portal
Publication:6137350
DOI10.1007/S00153-023-00889-ZMaRDI QIDQ6137350FDOQ6137350
F. Félix Lara Martin, Andrés Cordón-Franco
Publication date: 18 January 2024
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Provability algebras and proof-theoretic ordinals. I
- Reflection principles and provability algebras in formal arithmetic
- Classical recursion theory. The theory of functions and sets of natural numbers
- Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
- A jump operator on honest subrecursive degrees
- Augmented loop languages and classes of computable functions
- On the density of honest subrecursive classes
- The honest subrecursive classes are a lattice
- Streamlined subrecursive degree theory
- A Classification of the Recursive Functions
- Subrecursive degrees and fragments of Peano arithmetic
- Induction rules, reflection principles, and provably recursive functions
- Degrees of Total Algorithms versus Degrees of Honest Functions
- On the induction schema for decidable predicates
- Degrees of relative provability
- Saturated models of universal theories
- Existentially closed structures and Gödel's second incompleteness theorem
- Fragments of Arithmetic and true sentences
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas
- On the structure of subrecursive degrees
- A proof-theoretic analysis of collection
- Computer Science Logic
- Envelopes, indicators and conservativeness
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)
