Sciweavers

1322 search results - page 73 / 265
» Unsound Theorem Proving
Sort
View
VLSID
2006
IEEE
94views VLSI» more  VLSID 2006»
14 years 1 months ago
On the Size and Generation of Minimal N-Detection Tests
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N
Kalyana R. Kantipudi
CORR
2008
Springer
70views Education» more  CORR 2008»
13 years 7 months ago
Every Computably Enumerable Random Real Is Provably Computably Enumerable Random
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
Cristian S. Calude, Nicholas J. Hay
EJC
2007
13 years 7 months ago
On separating systems
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
Béla Bollobás, Alex D. Scott
JSYML
2006
61views more  JSYML 2006»
13 years 7 months ago
Shelah's categoricity conjecture from a successor for tame abstract elementary classes
R FOR TAME ABSTRACT ELEMENTARY CLASSES RAMI GROSSBERG AND MONICA VANDIEREN We prove a categoricity transfer theorem for tame abstract elementary classes.
Rami P. Grossberg, Monica Van Dieren
SYNTHESE
2008
85views more  SYNTHESE 2008»
13 years 7 months ago
Harmonising natural deduction
: Prawitz proved a theorem, formalising `harmony' in Natural Deduction systems, which showed that, corresponding to any deduction there is one to the same effect but in which ...
Barry Hartley Slater