1101 search results - page 101 / 221 » Forcing in proof theory |
115
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
140
Voted
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
140
Voted
ICFEM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
120
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
120
Voted
TALG
2008
15 years 3 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...