31 search results - page 1 / 7 » Nepomnjascij's Theorem and Independence Proofs in Bounded Ar... |
ECCC
2002
13 years 7 months ago
2002
CSR
2006
Springer
13 years 11 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
LCC
1994
13 years 11 months ago
1994
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
COCO
1997
Springer
13 years 12 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
AML
2007
13 years 7 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...