1322 search results - page 51 / 265 » Unsound Theorem Proving |
ECCC
2010
13 years 7 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
ENTCS
2008
13 years 7 months ago
2008
We de ne the e ective integrability of Fine-computable functions and e ectivize some fundamental limit theorems in the theory of Lebesgue integral such as Bounded Convergence Theo...
SYNTHESE
2010
13 years 6 months ago
2010
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
FOCS
2006
IEEE
14 years 1 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...