13 citations · 50 across the 19 of their papers we have counts for
Showing 2016 · cs.LOShow all
3 papers · 2 filters
cs.LO2016
Taking a Detour to Zero: An Alternative Formalization of Functions Beyond PR
David M. Cerna
There are two well known systems formalizing total recursion beyond primitive recursion (\textbf{PR}), system \textbf{T} by Gödel and system \textbf{F} by Girard and Reynolds. syst…
cs.LO2016★ 1 cited
A Generalized Resolution Proof Schema and the Pigeonhole Principle
David M. Cerna
The schematic CERES method is a method of cut elimination for proof schemata, that is a sequence of proofs with a recursive construction. Proof schemata can be thought of as a way…
cs.LO2016
Total Recursion over Lexicographical Orderings: Elementary Recursive Operators Beyond PR
David Cerna
In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as {\em leveled primitive recursion of o…