1302 search results - page 93 / 261 » Free-Style Theorem Proving |
LPAR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...
JAR
2007
13 years 10 months ago
2007
The vision of a computerised assistant to mathematicians has existed since the inception of theorem proving systems. The Alcor system has been designed to investigate and explore h...
JSYML
1998
13 years 9 months ago
1998
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
MLQ
2007
13 years 9 months ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...