188 search results - page 14 / 38 » What Is a Skeptical Proof |
89
Voted
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
We study the error robustness of tilings of the plane. The fundamental question is the following: given a tileset, what happens if we allow a small probability of errors? Are the o...
94
Voted
ENTCS
2010
15 years 22 days ago
2010
It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towar...
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
205
Voted
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
118
click to vote
EUROCRYPT
2007
Springer
15 years 6 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...