Cut Elimination for a Logic with Induction and Co-induction

Details Cut Elimination for a Logic with Induction and Co-induction Cut Elimination for a Logic with Induction and Co-induction

2010-09-30

arxiv.org/abs/1009.6171v1

Computer Science

Logic in Computer Science

42 pages, submitted to the Journal of Applied Logic

Scientific paper

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles are based on a proof theoretic (rather than set-theoretic) notion of definition. Definitions are akin to logic programs, where the left and right rules for defined atoms allow one to view theories as "closed" or defining fixed points. The use of definitions and free equality makes it possible to reason intentionally about syntax. We add in a consistent way rules for pre and post fixed points, thus allowing the user to reason inductively and co-inductively about properties of computational system making full use of higher-order abstract syntax. Consistency is guaranteed via cut-elimination, where we give the first, to our knowledge, cut-elimination procedure in the presence of general inductive and co-inductive definitions.

Affiliated with

Also associated with

No associations

Rating

Cut Elimination for a Logic with Induction and Co-induction 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 Cut Elimination for a Logic with Induction and Co-induction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cut Elimination for a Logic with Induction and Co-induction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-243498