Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo

Details Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo

2008-05-10

arxiv.org/abs/0805.1464v5

LMCS 6 (4:14) 2010

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-6(4:14)2010

In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the reasoning that is intrinsic of the theory does not appear in the length of proofs. In general, the congruence is defined through a rewrite system over terms and propositions. We define a rigorous framework to study proof lengths in deduction modulo, where the congruence must be computed in polynomial time. We show that even very simple rewrite systems lead to arbitrary proof-length speed-ups in deduction modulo, compared to using axioms. As higher-order logic can be encoded as a first-order theory in deduction modulo, we also study how to reinterpret, thanks to deduction modulo, the speed-ups between higher-order and first-order arithmetics that were stated by G\"odel. We define a first-order rewrite system with a congruence decidable in polynomial time such that proofs of higher-order arithmetic can be linearly translated into first-order arithmetic modulo that system. We also present the whole higher-order arithmetic as a first-order system without resorting to any axiom, where proofs have the same length as in the axiomatic presentation.

Affiliated with

Also associated with

No associations

Rating

Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo 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 Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188724