The computational content of classical arithmetic

Details The computational content of classical arithmetic The computational content of classical arithmetic

2009-01-16

arxiv.org/abs/0901.2551v3

Mathematics

Logic

Scientific paper

Almost from the inception of Hilbert's program, foundational and structural efforts in proof theory have been directed towards the goal of clarifying the computational content of modern mathematical methods. This essay surveys various methods of extracting computational information from proofs in classical first-order arithmetic, and reflects on some of the relationships between them. Variants of the G\"odel-Gentzen double-negation translation, some not so well known, serve to provide canonical and efficient computational interpretations of that theory.

Affiliated with

Also associated with

No associations

Rating

The computational content of classical arithmetic 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 The computational content of classical arithmetic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The computational content of classical arithmetic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127923