The logic of choice

Journal of Symbolic Logic

Volumn 65, Issue 3, 2000, Pages 1264-1310

  Blass, Andreas ^a,b   Gurevich, Yuri ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b MICROSOFT RESEARCH   (United States)

^c University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034259279     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2586700     Document Type: Article

References (32)

1. SERGE ABITEBOUL, ERIC SIMON, AND VICTOR VIANU [1990], Non-deterministic languages to express deterministic transformations, Proceedings of ACM symposium on principles of database systems.
2. SERGE ABITEBOUL AND VICTOR VIANU [1991], Nondeterminism in logic-based languages, Annals of Mathematics and Artificial Intelligence, vol. 3, pp. 151-186.
3. ASM [∞], ASM web site, the Michigan web site on abstract state machines, http://www.eecs.umich. edu/gasm/, maintained by James K. Huggins..
4. EGON BÖRGER, ERICH GRÄDEL, AND YURI GUREVICH [1996], The classical decision problem, Perspectives in Mathematical Logic, Springer Verlag.
5. XAVIER CAICEDO [1995], Hubert's ε-symbol in the presence of generalized quantifiers, Quantifiers: Logics, models and computation, volume II (M. Krynicki et al., editors), Kluwer Publishers, pp. 63-78.
6. GIUSEPPE DEL CASTILLO, YURI GUREVICH, AND KARL STROETMANN [1998], Typed abstract state machines, ASM Web Site.
7. ALONZO CHURCH [1936], An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58, pp. 345-363, [Davis 1965, pages 88-107].
8. ALONZO CHURCH [1936], An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58, pp. 345-363, [Davis 1965, pages 88-107].
9. MARTIN DAVIS [1965], The undecidable: Basic papers on undecidable propositions, unsolvable problems and computable functions, Raven Press, New York.
10. HEINZ-DIETER EBBINGHAUS AND JÖRG FLUM [1995], Finite model theory, Springer.
11. RON FAGIN [1974], Generalized first-order spectra and polynomial time recognizable sets, Complexity of computation (R.M. Karp, editor), SIAM-AMS Proceedings, vol. 7, pp. 43-73.
12. MICHAEL R. GAREY AND DAVID S. JOHNSON [1979], Computers and intractability: a guide to the theory of NP completeness, Freeman.
13. RAYMOND GREENLAW, H. JAMES HOOVER, AND WALTER L. RUZZO [1995], Limits to parallel computation: P-completeness theory, Oxford University Press.
14. YURI GUREVICH [1984], Toward logic tailored for computational complexity, Computation and proof theory (Logic Colloquium 1983) (M. Richter et al., editors), Lecture Notes in Mathematics, vol. 1104, Springer Verlag, pp. 175-216.
15. YURI GUREVICH [1988], Logic and the challenge of computer science, Current trends in theoretical computer science (E. Börger, editor), Computer Science Press, pp. 1-57.
16. YURI GUREVICH [1991], Evolving algebras: An attempt to discover semantics, Bulletin of European Association for Theoretical Computer Science, vol. 43, pp. 264-284, A slightly revised version appeared in G. Rozenberg and A. Salomaa, editors, "Current Trends in Theoretical Computer Science", World Scientific, 1993, 266-292.
17. YURI GUREVICH [1991], Evolving algebras: An attempt to discover semantics, Bulletin of European Association for Theoretical Computer Science, vol. 43, pp. 264-284, A slightly revised version appeared in G. Rozenberg and A. Salomaa, editors, "Current Trends in Theoretical Computer Science", World Scientific, 1993, 266-292.
18. YURI GUREVICH [1995], Evolving algebra 1993: Lipari guide, Specification and validation methods (E. Börger, editor), Oxford University Press, See also "May 1997 Draft of the ASM Guide", Technical Report CSE-TR-336-97, EECS Department, University of Michigan, 1997. Found at http://www.eecs.umich.edu/gasm/, pp. 9-36.
19. YURI GUREVICH [1995], Evolving algebra 1993: Lipari guide, Specification and validation methods (E. Börger, editor), Oxford University Press, See also "May 1997 Draft of the ASM Guide", Technical Report CSE-TR-336-97, EECS Department, University of Michigan, 1997. Found at http://www.eecs.umich.edu/gasm/, pp. 9-36.
20. YURI GUREVICH [1997], A guide to abstract state machines, unpublished notes.
21. DAVID HILBERT AND PAUL BERNAYS [1939], Grundlagen der Mathematik, Volume 2, Springer Verlag.
22. STEPHEN COLE KLEENE [1952], Introduction to metamathematics, D. Van Nostrand, New York, reprinted by Wolters-Noordhoff, Groningen and North-Holland, Amsterdam in 1971.
23. A. C. LEISENRING [1969], Mathematical logic and Hilbert's ε-symbol, Macdonald Technical and Scientific, London.
24. YIANNIS N. MOSCHOVAKIS [1974], Elementary induction on abstract structures, North-Holland, Amsterdam.
25. YIANNIS N. MOSCHOVAKIS [1980], Descriptive set theory, North Holland, Amsterdam.
26. MARTIN OTTO [1998], Epsilon-logic is more expressive than first-order logic over finite structures, to appear.
27. PETER PÄPPINGHAUS AND MARTIN WIRSING [1983], Nondeterministic three-valued logic: Isotonic and guarded truth-functions, Studia Logica, vol. XLII.1, pp. 1-22.
28. NICHOLAS RESCHER [1969], Many-valued logics, McGraw-Hill, New York.
29. BORIS A. TRAKHTENBROT [1950], Impossibility of an algorithm for the decision problem on finite classes, Doklady Akad. Nauk, vol. 70, pp. 569-572.
30. ALAN M. TURING [1936], On computable numbers, with an application to the Entscheidungsproblem, Proceedings of London Mathematical Society, vol. 2, no. 42, pp. 230-236, and no. 43 (1936), 544-546. [Davis 1965, pages, 115-153.].
31. ALAN M. TURING [1936], On computable numbers, with an application to the Entscheidungsproblem, Proceedings of London Mathematical Society, vol. 2, no. 42, pp. 230-236, and no. 43 (1936), 544-546. [Davis 1965, pages, 115-153.].
32. ALAN M. TURING [1936], On computable numbers, with an application to the Entscheidungsproblem, Proceedings of London Mathematical Society, vol. 2, no. 42, pp. 230-236, and no. 43 (1936), 544-546. [Davis 1965, pages, 115-153.].