68 search results - page 6 / 14 » Three Tactic Theorem Proving |
88
Voted
SIGECOM
2008
ACM
14 years 11 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
110
Voted
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
APAL
2005
14 years 11 months ago
2005
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
96
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between ...
220
click to vote
AML
2011
14 years 6 months ago
2011
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...