2 search results - page 1 / 1 » Efficiently Simulating Higher-Order Arithmetic by a First-Or... |
CORR
2008
Springer
13 years 2 months ago
2008
Springer
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 ...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...