84 search results - page 3 / 17 » An Algebraic Proof of Deuber's Theorem |
LPNMR
2005
Springer
13 years 11 months ago
2005
Springer
ID-logic uses ideas from the field of logic programming to extend second order logic with non-monotone inductive defintions. In this work, we reformulate the semantics of this lo...
TYPES
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
TPHOL
2005
IEEE
13 years 11 months ago
2005
IEEE
Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem provin...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...