290 search results - page 21 / 58 » Theorem Proving Using Lazy Proof Explication |
153
click to vote
FOCS
2006
IEEE
15 years 10 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...
123
click to vote
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
We prove in this paper that if r and s are two semilinear power series in commuting variables and s has bounded coefficients, then r-s is a rational series. This result can be tho...
137
click to vote
TYPES
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
120
click to vote
CLIMA
2007
15 years 5 months ago
2007
The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from ...
122
click to vote
ENTCS
2007
15 years 4 months ago
2007
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...