The following pages link to Computer Science Logic (Q5311268):
Displaying 12 items.
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- Characterizing the elementary recursive functions by a fragment of Gödel's \(T\) (Q1590659) (← links)
- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion (Q1827398) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- On axiom schemes for \(T\)-provably \(\Delta_1\) formulas (Q2449854) (← links)
- Local induction and provably total computable functions (Q2453069) (← links)
- Classifying the Provably Total Functions of PA (Q3430936) (← links)
- (Q4470530) (← links)
- Provably total functions of Basic Arithmetic (Q4808473) (← links)
- (Q5591512) (← links)
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule (Q5937826) (← links)
- Semi-honest subrecursive degrees and the collection rule in arithmetic (Q6137350) (← links)
