72 search results - page 1 / 15 » Proving Consistency of Equational Theories in Bounded Arithm... |
JSYML
2002
13 years 4 months ago
2002
We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symb...
JSYML
2006
13 years 4 months ago
2006
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
CSL
2008
Springer
13 years 6 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...