1410 search results - page 72 / 282 » Proving theorems by reuse |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
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 ...
EJC
2007
13 years 10 months ago
2007
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.
JSYML
2006
13 years 10 months ago
2006
R FOR TAME ABSTRACT ELEMENTARY CLASSES RAMI GROSSBERG AND MONICA VANDIEREN We prove a categoricity transfer theorem for tame abstract elementary classes.
SYNTHESE
2008
13 years 10 months ago
2008
: 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 ...
COCO
2007
Springer
14 years 4 months ago
2007
Springer
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...