Yuri Gurevich (gurevich)

Beiträge zu Philosophie.ch

Bibliography

Blass, Andreas, Dershowitz, Nachum and Gurevich, Yuri. 2009. “When are Two Algorithms the Same?” The Bulletin of Symbolic Logic 15(2): 145–168.
Blass, Andreas and Gurevich, Yuri. 2000. “The Logic of Choice.” The Journal of Symbolic Logic 65(3): 1264–1310.
Blass, Andreas and Gurevich, Yuri. 2006. “Algorithms: A Quest for Absolute Definitions.” in Church’s Thesis After 70 Years, edited by Adam Olszewski, Jan Woleński, and Robert Janusz, pp. 24–57. Ontos Mathematical Logic n. 1. Heusenstamm b. Frankfurt: Ontos Verlag.
Blass, Andreas and Gurevich, Yuri. 2011. “Zero-One Laws: Thesauri and Parametric Conditions.” in Proof, Computation and Agency. Logic at the Crossroads, edited by Johan van Benthem, Amitabha Gupta, and Rohit Parikh, pp. 99–114. Synthese Library n. 352. Dordrecht: Springer.
Blass, Andreas, Gurevich, Yuri and Shelah, Saharon. 2002. “On Polynomial Time Computation over Unordered Structures.” The Journal of Symbolic Logic 67(3): 1093–1125.
Börger, Egon, Grädel, Erich and Gurevich, Yuri. 1997. The Classical Decision Problem. Berlin: Springer.
Dawar, Anuj and Gurevich, Yuri. 2002. “Fixed Point Logics.” The Bulletin of Symbolic Logic 8(1): 65–88.
Dershowitz, Nachum and Gurevich, Yuri. 2008. “A Natural Axiomatization of Computability and Proof of Church’s Thesis.” The Bulletin of Symbolic Logic 14(3): 299–350.
Gurevich, Yuri. 1985. “Monadic Second-Order Theories.” in Model-Theoretic Logics, edited by Jon K. Barwise and Solomon Feferman, pp. 479–506. Perspectives in Mathematical Logic. Berlin: Springer.
Gurevich, Yuri. 1988a. “Algorithms in the World of Bounded Resources.” in The Universal Turing Machine: A Half-Century Survey, edited by Rolf Herken, 1st ed., pp. 407–416. Oxford: Oxford University Press. Second edition: Herken (1995).
Gurevich, Yuri. 1988b. “Logic and the Challenge of Computer Science.” in Trends in Theoretical Computer Science, edited by Egon Börger, pp. 1–57. Rockville, Maryland: Computer Science Press, Inc.
Gurevich, Yuri and Harrington, Leo A. 1982. “Trees, Automata and Games.” in ACM Symposium on Theory of Computing, pp. 60–65. New York: ACM Press.
Gurevich, Yuri and Shelah, Saharon. 1983. “Interpreting Second-Order Logic in the Monadic Theory of Order.” The Journal of Symbolic Logic 48(3): 816–828.
Gurevich, Yuri and Shelah, Saharon. 1985a. “The Decision Problem in Branching Time Logic.” The Journal of Symbolic Logic 50: 668–661.
Gurevich, Yuri and Shelah, Saharon. 1985b. “To the Decision Problem in Branching Time Logic.” in Foundations of Logic and Linguistics. Problems and Their Solutions, edited by Georg J. W. Dorn and Paul Weingartner, pp. 181–198. Berlin: Springer.
Gurevich, Yuri and Shelah, Saharon. 1996. “On Finite Rigid Structures.” The Journal of Symbolic Logic 61(2): 549–562.