368 search results - page 19 / 74 » Arithmetic as a Theory Modulo |
APAL
2004
13 years 8 months ago
2004
The purpose of this article is to present a new theory IPA() for fixed points over arithmetic which allows the building up of fixed points in a very nested and entangled way. But ...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
We present a novel third-order theory W1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
MST
2007
13 years 8 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
CIE
2005
Springer
14 years 2 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...