Computer Science – Logic in Computer Science
Scientific paper
2012-01-05
EPTCS 75, 2012, pp. 28-32
Computer Science
Logic in Computer Science
In Proceedings DICE 2011, arXiv:1201.0345
Scientific paper
10.4204/EPTCS.75.3
A new characterization of provably recursive functions of first-order
arithmetic is described. Its main feature is using only terms consisting of 0,
the successor S and variables in the quantifier rules, namely, universal
elimination and existential introduction.
No associations
LandOfFree
Provably Total Functions of Arithmetic with Basic Terms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Provably Total Functions of Arithmetic with Basic Terms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Provably Total Functions of Arithmetic with Basic Terms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-609579