An arithmetical proof of the strong normalization for the $λ$-calculus with recursive equations on types

Details An arithmetical proof of the strong normalization for the $λ$-calculus with recursive equations on types An arithmetical proof of the strong normalization for the $λ$-calculus with recursive equations on types

2009-05-07

arxiv.org/abs/0905.1032v1

Typed Lambda Calculi and Applications, Paris : France (2007)

Mathematics

Logic

Scientific paper

We give an arithmetical proof of the strong normalization of the $\lambda$-calculus (and also of the $\lambda\mu$-calculus) where the type system is the one of simple types with recursive equations on types. The proof using candidates of reducibility is an easy extension of the one without equations but this proof cannot be formalized in Peano arithmetic. The strength of the system needed for such a proof was not known. Our proof shows that it is not more than Peano arithmetic.

Affiliated with

Also associated with

No associations

Rating

An arithmetical proof of the strong normalization for the $λ$-calculus with recursive equations on types 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 An arithmetical proof of the strong normalization for the $λ$-calculus with recursive equations on types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An arithmetical proof of the strong normalization for the $λ$-calculus with recursive equations on types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-455703