Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. SIAM journal on computing, vol. 18 , pp. 186–208. - Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that release minimum knowledge. Mathematical foundations of computer science 1986, Proceedings of the 12th symposium, Bratislava, Czechoslovakia, August 25–29, 1986, edited by J. Gruska, B. Rovan, and J. Wiedermann, Lecture notes in computer science, vol. 233, Springer-Verlag, Berlin, Heidelberg, New York, etc., 1986, pp. 639–650. - Oded Goldreich. Randomness, interactive proofs, and zero-knowledge—a survey. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988, pp. 377–405 [Book Review]

Journal of Symbolic Logic 56 (3):1092-1094 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275080

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Knowledge Complexity of Interactive Proof Systems.Proofs that Release Minimum Knowledge.Randomness, Interactive Proofs, and Zero-Knowledge--A Survey. [REVIEW]Lance Fortnow, Shafi Goldwasser, Silvio Micali, Charles Rackoff, Oded Goldreich, Avi Wigderson, J. Gruska, B. Rovan, J. Wiedermann & Rolf Herken - 1991 - Journal of Symbolic Logic 56 (3):1092.
Andrew Hodges. Alan Turing and the Turing machine. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 3–15. - Stephen C. Kleene. Turing's analysis of computahility, and major applications of it. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 17–54. - Robin Gandy. The confluence of ideas in 1936. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 55–111. - Solomon Feferman. Turing in the land of O. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 113–147. - Martin Davis. Mathematica. [REVIEW]John N. Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.
Uwe Schöning. Complexity theory and interaction. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 561–580. [REVIEW]Steven Lindell - 1991 - Journal of Symbolic Logic 56 (3):1091-1092.
Allen H. Brady. The busy beaver game and the meaning of life. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 259–277. [REVIEW]Arnold Oberschelp - 1991 - Journal of Symbolic Logic 56 (3):1091-1091.
Michael J. Beeson. Computerizing mathematics: logic and computation. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. pp. 191–225. [REVIEW]J. C. Shepherdson - 1991 - Journal of Symbolic Logic 56 (3):1090-1091.
Boris Trakhtenbrot. Comparing the Church and Turing approaches: two prophetical messages. The universal Turing machine, A half-century survey, edited by Rolf Herken, Kammerer & Unversagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988, pp. 603–630. [REVIEW]Giuseppe Longo - 1994 - Journal of Symbolic Logic 59 (4):1434-1436.
Schöning Uwe. Complexity and structure. Lecture notes in computer science, vol. 211. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1986, v + 99 pp. [REVIEW]Stephen R. Mahaney - 1989 - Journal of Symbolic Logic 54 (3):1106-1107.
Rolf Herken . The Universal Turing Machine: A Half-Century Survey. Oxford: Oxford University Press, 1988. Pp. xiv + 661. ISBN 0-19-853741-7. £55.00. [REVIEW]Steve Russ - 1989 - British Journal for the History of Science 22 (4):451-452.
Donald A. Martin. The largest countable this, that, and the other. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, pp. 97–106. - Alexander S. Kechris, Donald A. Martin, and Robert M. Solovay. Introduction to Q-theory. Cabal seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture notes in mathematics, vol. 1019, Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1983, pp. 199–282. - Steve Jackson. AD and the projective ordinals. Cabal seminar 81–85, Proceedings, Caltech-UCLA Logic Seminar 1981–85, edited by A. S. Kechris, D. A. Martin, and J. R. Steel, Lecture notes in mathematics, vol. 1333, Springer-Verlag, Berlin, Heidelberg, New York, etc., 1988, pp. 117–220. [REVIEW]Sy D. Friedman - 1992 - Journal of Symbolic Logic 57 (1):262-264.
Ferrante Jeanne and Rackoff Charles W.. The computational complexity of logical theories. Lecture notes in mathematics, vol. 718. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 243 pp. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
Goldblatt Robert. Axiomatising the logic of computer programming. Lecture notes in computer science, vol. 130. Springer-Verlag, Berlin, Heidelberg, and New York, 1982, xi + 304 pp. [REVIEW]Mitchell Wand - 1985 - Journal of Symbolic Logic 50 (3):854-855.
Feferman Solomon. A language and axioms for explicit mathematics. Algebra and logic, Papers from the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia, edited by Crossley J. N., Lecture notes in mathematics, vol. 450, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 87–139.Feferman Solomon. Constructive theories of functions and classes. Logic colloquium '78, Proceedings of the colloquium held in Mons, August 1978, edited by Boffa Maurice, van Dalen Dirk, and McAloon Kenneth, Studies in logic and the foundations of mathematics, vol. 97, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1979, pp. 159–224. [REVIEW]G. R. Renardel de Lavalette & A. S. Troelstra - 1984 - Journal of Symbolic Logic 49 (1):308-311.
Wilfried Buchholz. Notation systems for infinitary derivations_. Archive for mathematical logic, vol. 30 no. 5–6 (1991), pp. 277–296. - Wilfried Buchholz. _Explaining Gentzen's consistency proof within infinitary proof theory_. Computational logic and proof theory, 5th Kurt Gödel colloquium, KGC '97, Vienna, Austria, August 25–29, 1997, Proceedings, edited by Georg Gottlob, Alexander Leitsch, and Daniele Mundici, Lecture notes in computer science, vol. 1289, Springer, Berlin, Heidelberg, New York, etc., 1997, pp. 4–17. - Sergei Tupailo. _Finitary reductions for local predicativity, I: recursively regular ordinals. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Háajek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., etc., 2000, pp. 465–499. [REVIEW]Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
Murray G. Bell. Spaces of ideals of partial functions. Set theory and its applications, Proceedings of a conference held at York University, Ontario, Canada, Aug. 10–21,1987, edited by J. Streprāns and S. Watson, Lecture notes in mathematics, vol. 1401, Springer-Verlag, Berlin etc. 1989, pp. 1–4. - Alan Dow. Compact spaces of countable tightness in the Cohen model. Set theory and its applications, Proceedings of a conference held at York University, Ontario, Canada, Aug. 10–21,1987, edited by J. Streprāns and S. Watson, Lecture notes in mathematics, vol. 1401, Springer-Verlag, Berlin etc. 1989, pp. 55–67. - Peter J. Nyikos. Classes of compact sequential spaces. Set theory and its applications, Proceedings of a conference held at York University, Ontario, Canada, Aug. 10–21,1987, edited by J. Streprāns and S. Watson, Lecture notes in mathematics, vol. 1401, Springer-Verlag, Berlin etc. 1989, pp. 135–159. - Franklin D. Tall. Topological problems for set-theorists. Set theory and its appl. [REVIEW]Judith Roitman - 1991 - Journal of Symbolic Logic 56 (2):753-755.
Harel David. First-order dynamic logic. Lecture notes in computer science, vol. 68. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 133 pp. [REVIEW]Jerzy Tiuryn - 1982 - Journal of Symbolic Logic 47 (2):453-454.

Analytics

Added to PP
2014-04-06

Downloads
41 (#371,653)

6 months
4 (#724,033)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references