Sciweavers

1322 search results - page 160 / 265
» Unsound Theorem Proving
Sort
View
JSYML
1998
61views more  JSYML 1998»
13 years 8 months ago
Superdestructibility: A Dual to Laver's Indestructibility
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 ...
Joel David Hamkins, Saharon Shelah
MLQ
2007
90views more  MLQ 2007»
13 years 8 months ago
Kripke submodels and universal sentences
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...
Ben Ellison, Jonathan Fleischmann, Dan McGinn, Wim...
FOCS
2010
IEEE
13 years 7 months ago
The Coin Problem and Pseudorandomness for Branching Programs
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...
Joshua Brody, Elad Verbin
ICML
2007
IEEE
14 years 9 months ago
A transductive framework of distance metric learning by spectral dimensionality reduction
Distance metric learning and nonlinear dimensionality reduction are two interesting and active topics in recent years. However, the connection between them is not thoroughly studi...
Fuxin Li, Jian Yang, Jue Wang
CADE
2009
Springer
14 years 9 months ago
Superposition and Model Evolution Combined
We present a new calculus for first-order theorem proving with equality, ME+Sup, which generalizes both the Superposition calculus and the Model Evolution calculus (with equality)...
Peter Baumgartner, Uwe Waldmann