Sciweavers

118 search results - page 15 / 24
» A simple proof of Bazzi's theorem
Sort
View
85
Voted
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 15 days ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
CRYPTO
2007
Springer
116views Cryptology» more  CRYPTO 2007»
15 years 6 months ago
Random Oracles and Auxiliary Input
We introduce a variant of the random oracle model where oracle-dependent auxiliary input is allowed. In this setting, the adversary gets an auxiliary input that can contain informa...
Dominique Unruh
88
Voted
LICS
2002
IEEE
15 years 5 months ago
Little Engines of Proof
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
Natarajan Shankar
94
Voted
RTA
2005
Springer
15 years 5 months ago
Arithmetic as a Theory Modulo
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
Gilles Dowek, Benjamin Werner
120
Voted
FROCOS
2005
Springer
15 years 6 months ago
Connecting a Logical Framework to a First-Order Logic Prover
We present one way of combining a logical framework and first-order logic. The logical framework is used as an interface to a first-order theorem prover. Its main purpose is to k...
Andreas Abel, Thierry Coquand, Ulf Norell