1410 search results - page 29 / 282 » Proving theorems by reuse |
134
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
131
click to vote
CADE
2002
Springer
16 years 6 months ago
2002
Springer
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
150
click to vote
ASIAN
2006
Springer
15 years 9 months ago
2006
Springer
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
178
click to vote
JSYML
2010
15 years 21 days ago
2010
We reformulate, in the context of continuous logic, an oscillation theorem proved by G. Hjorth and give a proof of the theorem in that setting which is similar to, but simpler than...
135
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...