Sciweavers

211 search results - page 17 / 43
» On the Proof Theory of the Existence Predicate
Sort
View
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 10 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
JSYML
2006
91views more  JSYML 2006»
13 years 8 months ago
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories
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...
Leszek Aleksander Kolodziejczyk
LPAR
1999
Springer
14 years 29 days ago
Extensions to the Estimation Calculus
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
Jeremy Gow, Alan Bundy, Ian Green
SETA
2010
Springer
228views Mathematics» more  SETA 2010»
13 years 7 months ago
Nega-Hadamard Transform, Bent and Negabent Functions
In this paper we start developing a detailed theory of nega– Hadamard transforms. Consequently, we derive several results on negabentness of concatenations, and partially-symmetr...
Pantelimon Stanica, Sugata Gangopadhyay, Ankita Ch...
CSL
2008
Springer
13 years 10 months ago
Proving Infinitude of Prime Numbers Using Binomial Coefficients
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 &...
Phuong Nguyen