𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Propositional Proof Systems and Fast Consistency Provers

✍ Scribed by Joosten, Joost J.

Book ID
124069818
Publisher
University of Notre Dame
Year
2007
Tongue
English
Weight
253 KB
Volume
48
Category
Article
ISSN
0029-4527

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Multi-prover Encoding Schemes and Three-
Multi-prover Encoding Schemes and Three-prover Proof Systems
✍ GΓ‘bor Tardos πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 401 KB

Suppose two provers agree in a polynomial p and want to reveal a single vaiue y=p(x) to a verifier where x is chosen arbitrarily by the verifier. Whereas honest provers should be able to agree on any polynomial p the verifier wants to be sure that with any (cheating) pair of provers the value y he r

On the correspondence between arithmetic
On the correspondence between arithmetic theories and propositional proof systems – a survey
✍ Olaf Beyersdorff πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 216 KB

## Abstract The purpose of this paper is to survey the correspondence between bounded arithmetic and propositional proof systems. In addition, it also contains some new results which have appeared as an extended abstract in the proceedings of the conference TAMC 2008 [11]. Bounded arithmetic is cl