168 found
Order:
Disambiguations:
Martin Davis [168]Martin D. Davis [1]
See also:
Profile: Martin Stone Davis (University of Arizona)
  1.  81
    Martin Davis (1958). Computability & Unsolvability. Dover.
    Classic text considersgeneral theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   82 citations  
  2.  80
    Martin Davis (ed.) (1965). The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Dover Publication.
    "A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by (...)
    Direct download  
     
    Export citation  
     
    My bibliography   32 citations  
  3. Martin Davis, Edgar E. K. Lopez-Escobar & Wilfred Sieg (1986). Meeting of the Association for Symbolic Logic: Washington, D. C., 1985. Journal of Symbolic Logic 51 (4):1085-1092.
  4.  26
    Martin Davis (1990). Is Mathematical Insight Algorithmic? Behavioral and Brain Sciences 13 (4):659-660.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  5.  48
    Martin Davis (2005). What Did Gödel Believe and When Did He Believe It? Bulletin of Symbolic Logic 11 (2):194-206.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  6. Martin Davis (1978). Applied Nonstandard Analysis. Journal of Symbolic Logic 43 (2):383-384.
    Direct download  
     
    Export citation  
     
    My bibliography   14 citations  
  7.  1
    Martin Davis (2001). The Universal Computer. The Road From Leibniz to Turing. Bulletin of Symbolic Logic 7 (1):65-66.
    Direct download  
     
    Export citation  
     
    My bibliography   5 citations  
  8.  7
    Martin Davis & Hilary Putnam (1966). A Computing Procedure for Quantification Theory. Journal of Symbolic Logic 31 (1):125-126.
    Direct download  
     
    Export citation  
     
    My bibliography   9 citations  
  9.  15
    Martin Davis (1993). How Subtle is Gödel's Theorem? More on Roger Penrose. Behavioral and Brain Sciences 16 (3):611.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  10. Martin Davis (2006). Why There is No Such Discipline as Hypercomputation. Applied Mathematics and Computation, Volume 178, Issue 1, 1.
     
    Export citation  
     
    My bibliography   2 citations  
  11.  24
    Martin Davis (1990). Gödel Kurt. Über Die Vollständigkeit des Logikkalküls (1929). Collected Works, Volume I, Publications 1929–1936, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986, Even Pp. 60–100. Gödel Kurt. On the Completeness of the Calculus of Logic (1929). English Translation by Stefan Bauer-Mengelberg and Jean van Heijenoort of the Preceding. Collected ... [REVIEW] Journal of Symbolic Logic 55 (1):341-342.
    Direct download  
     
    Export citation  
     
    My bibliography  
  12.  2
    Martin Davis (1982). Selected Papers of Abraham Robinson. Volume 2. Nonstandard Analysis and Philosophy. Edited and with an Introduction by Luxemburg W. A. J. And Körner S.. Yale University Press, New Haven and London 1979, Xlv + 582 Pp.Seligman George B.. Biography of Abraham Robinson, Pp. Xi–Xxx. A Reprint of XLVII 197.Luxemburg W. A. J.. Introduction to Papers on Nonstandard Analysis and Analysis, Pp. Xxxi–Xxxix.Körner S.. Introduction to Papers on Philosophy, Pp. Xli–Xlv.Robinson Abraham. Non-Standard Analysis, Pp. 3–11. A Reprint of XXXIV 292.Robinson Abraham. On Languages Which Are Based on Non-Standard Arithmetic, Pp. 12–46. A Reprint of XXXIV 516.Robinson Abraham. On Generalized Limits and Linear Functionals, Pp. 47–61. A Reprint of XXXIV 292.Robinson Abraham. On the Theory of Normal Families, Pp. 62–87. A Reprint of XXXVII 215.Bernstein Allen R. And Robinson Abraham. Solution of an Invariant Subspace Problem of K. T. Smith and P. R. Halmos, Pp. 88–98. A Reprint of XXXIV 292.Robinson Abraham. Topic. [REVIEW] Journal of Symbolic Logic 47 (1):203-210.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  13.  5
    David Hilbert, Mary Winston Newsom, Felix E. Browder, Donald A. Martin, G. Kreisel & Martin Davis (1979). Mathematical Problems. Lecture Delivered Before the International Congress of Mathematicians at Paris in 1900. Journal of Symbolic Logic 44 (1):116-119.
    Direct download  
     
    Export citation  
     
    My bibliography   2 citations  
  14.  1
    Martin Davis, George Logemann & Donald Loveland (1967). A Machine Program for Theorem-Proving. Journal of Symbolic Logic 32 (1):118-118.
    Direct download  
     
    Export citation  
     
    My bibliography   6 citations  
  15.  8
    Stephen C. Kleene & Martin Davis (1990). Origins of Recursive Function Theory. Journal of Symbolic Logic 55 (1):348-350.
    Direct download  
     
    Export citation  
     
    My bibliography  
  16.  3
    Martin Davis, Hilary Putnam & Julia Robinson (1970). The Decision Problem for Exponential Diophantine Equations. Journal of Symbolic Logic 35 (1):151-152.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  17.  17
    Martin Davis (1997). Minsky ML. Size and Structure of Universal Turing Machines Using Tag Systems. Recursive Function Theory, Proceedings of Symposia in Pure Mathematics, Vol. 5, American Mathematical Society, Providence 1962, Pp. 229–238. [REVIEW] Journal of Symbolic Logic 31 (4):655-655.
    Direct download  
     
    Export citation  
     
    My bibliography  
  18.  6
    Martin Davis (1966). Meeting of the Association for Symbolic Logic. Journal of Symbolic Logic 31 (4):697-706.
  19.  12
    Martin Davis (1953). Arithmetical Problems and Recursively Enumerable Predicates. Journal of Symbolic Logic 18 (1):33-41.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  20.  12
    Martin Davis (1990). Gödel Kurt. Eine Interpretation des Intuitionistischen Aussagenkalküls (1933f). A Reprint of 41812. Collected Works, Volume I, Publications 1929–1936, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986, Pp. 300, 302. Gödel Kurt. An Interpretation of the Intuitionistic Propositional Calculus (1933f). English Translation by John Dawson of the ... [REVIEW] Journal of Symbolic Logic 55 (1):346-346.
    Direct download  
     
    Export citation  
     
    My bibliography  
  21. M. D. Davis & Martin Davis (1970). A Note on Universal Turing Machines. Journal of Symbolic Logic 35 (4):590-590.
    Direct download  
     
    Export citation  
     
    My bibliography   4 citations  
  22.  11
    Martin Davis (1995). American Logic in the 1920s. Bulletin of Symbolic Logic 1 (3):273-278.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  23. Emil Leon Post & Martin Davis (1994). Solvability, Provability, Definability the Collected Works of Emil L. Post. Monograph Collection (Matt - Pseudo).
    No categories
     
    Export citation  
     
    My bibliography   1 citation  
  24.  1
    Martin Davis (1990). Gödel Kurt. Über Die Länge von Beweisen . A Reprint of I 116. Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986 Pp. 396, 398.Gödel Kurt. On the Length of Proofs . English Translation by Stefan Bauer-Mengelberg and Jean van Heijenoort of the Preceding. Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986 Pp. 397, 399.Parikh Rohit. Introductory Note to 1936a. Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986 Pp. 394– 397. [REVIEW] Journal of Symbolic Logic 55 (1):348.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  25.  1
    Martin Davis (1951). Robinson Julia. General Recursive Functions. Proceedings of the American Mathematical Society, Vol. 1 No. 6 , Pp. 703–718. [REVIEW] Journal of Symbolic Logic 16 (4):280.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26.  8
    Martin Davis (1995). It is Difficult to Admit That the Word If Acquires, When Written⊃, a Virtue It Did Not Possess When Written If. Principia Provided No Very Convincing Answer to Poincaré. Indeed the Fact That the Authors of Principia Saw Fit to Place Their First Two “Primitive Propo-Sitions”. [REVIEW] Bulletin of Symbolic Logic 1 (3).
    Direct download  
     
    Export citation  
     
    My bibliography  
  27. Martin Davis (1966). Review: Corrado Bohm, On a Family of Turing Machines and the Related Programming Language. [REVIEW] Journal of Symbolic Logic 31 (1):140-140.
     
    Export citation  
     
    My bibliography  
  28.  20
    Martin Davis & Hilary Putnam (1958). Reductions of Hilbert's Tenth Problem. Journal of Symbolic Logic 23 (2):183-187.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  29.  6
    Martin Davis (1983). Church's Thesis and Representation of Grammars. Behavioral and Brain Sciences 6 (3):404.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30.  6
    Martin Davis (1990). Gödel Kurt. Über Die Länge von Beweisen (1936a). A Reprint of I 116. Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986 Pp. 396, 398. Gödel Kurt. On the Length of Proofs (1936a). English Translation by Stefan Bauer-Mengelberg and Jean van Heijenoort of the Preceding. Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon ... [REVIEW] Journal of Symbolic Logic 55 (1):348-348.
    Direct download  
     
    Export citation  
     
    My bibliography  
  31.  10
    Martin Davis (1990). Book Review: Melvin Fitting. Computability Theory, Semantics, and Logic Programming. [REVIEW] Notre Dame Journal of Formal Logic 31 (3):485-486.
  32.  6
    Martin Davis (1996). Böhm Corrado. On a Family of Turing Machines and the Related Programming Language. ICC Bulletin, Vol. 3 (1964), Pp. 185–194. [REVIEW] Journal of Symbolic Logic 31 (1):140-140.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  33.  6
    Martin Davis (1990). Gödel Kurt. Zur Intuitionistischen Arithmetik Und Zahlentheorie (1933e). A Reprint of 41811. Collected Works, Volume I, Publications 1929–1936, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986, Even Pp. 286–294. Gödel Kurt. On Intuitionistic Arithmetic and Number Theory (1933e). English Translation by Stefan Bauer-Mengelberg and Jean van ... [REVIEW] Journal of Symbolic Logic 55 (1):346-346.
    Direct download  
     
    Export citation  
     
    My bibliography  
  34.  2
    Martin Davis (1983). Review: Edward Nelson, Internal Set Theory: A New Approach to Nonstandard Analysis. [REVIEW] Journal of Symbolic Logic 48 (4):1203-1204.
  35. Martin Davis (1968). Review: John McCarthy, Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I. [REVIEW] Journal of Symbolic Logic 33 (1):117-117.
     
    Export citation  
     
    My bibliography  
  36.  4
    Martin Davis (1990). Gödel Kurt. On Undecidable Propositions of Formal Mathematical Systems (1934). A Reprint of XXXI 484. Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986 Pp. 346–369. Gödel Kurt. Postscriptum. A Reprint of XXXI 484. Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory ... [REVIEW] Journal of Symbolic Logic 55 (1):347-347.
    Direct download  
     
    Export citation  
     
    My bibliography  
  37. Martin Davis (1990). Review: Kurt Godel, On Undecidable Propositions of Formal Mathematical Systems (1934); Kurt Godel, Postscriptum; Stephen C. Kleene, Introductory Note to 1934. [REVIEW] Journal of Symbolic Logic 55 (1):347-347.
     
    Export citation  
     
    My bibliography  
  38.  3
    Martin Davis (1990). Gödel Kurt. Review of Church's A Set of Postulates for the Foundation of Logic (3594). Collected Works, Volume I, Publications 1929–1936, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986, Pp. 256, 258.(Reprinted From Zentralblatt Für Mathematik Und Ihre Grenzgebiete, Vol. 4 (1932), Pp. 145–146.) Gödel Kurt. English Translation by John Dawson of ... [REVIEW] Journal of Symbolic Logic 55 (1):345-345.
    Direct download  
     
    Export citation  
     
    My bibliography  
  39.  3
    Martin Davis (1990). Gödel Kurt. Review of Skolem's Über Die Unmöglichkeit Einer Vollständigen Charakterisierung der Zahlenreihe Mittels Eines Endlichen Axiomensystems (24716). Reelle Funktionen, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986 Pp. 378, 380.(Reprinted From Zentralblatt Für Mathematik Undihre Grenzgebiete, Vol. 7 (1934), Pp. 193–194.) Gödel Kurt ... [REVIEW] Journal of Symbolic Logic 55 (1):347-348.
    Direct download  
     
    Export citation  
     
    My bibliography  
  40.  3
    Martin Davis (1990). Gödel Kurt. Diskussion Zur Grundlegung der Mathematik (1931a). A Reprint of 4184. Collected Works, Volume I, Publications 1929–1936, by Kurt Gödel, Edited by Feferman Solomon, Dawson John W. Jr., Kleene Stephen C., Moore Gregory H., Solovay Robert M., and van Heijenoort Jean, Clarendon Press, Oxford University Press, New York and Oxford 1986, Pp. 200, 202. Gödel Kurt. Discussion on Providing a Foundation for Mathematics (1931a). English Translation by John Dawson of the Preceding. Collected Works ... [REVIEW] Journal of Symbolic Logic 55 (1):343-343.
    Direct download  
     
    Export citation  
     
    My bibliography  
  41. Martin Davis (1990). Review: Kurt Godel, John Dawson, On the Intuitionistic Propositional Calculus (1932); A. S. Troelstra, Introductory Note to 1932. [REVIEW] Journal of Symbolic Logic 55 (1):344-344.
     
    Export citation  
     
    My bibliography  
  42. Martin Davis (1990). Review: Kurt Godel, John Dawson, Review of Skolem's Uber die Unmoglichkeit Einer Vollstandigen Charakterisierung der Zahlenreihe Mittels Eines Endlichen Axiomensystems (24716); Kurt Godel, John Dawson, Review of Skolem's Uber die Nicht-Charakterisierbarkeit der Zahlenreihe Mittels endlich oder Abzahlbar Unendlich Vieler Aussagen mit Ausschlieblich Zahlenvariablen; Robert Vaught, Introductory Note to 1934c and 1935. [REVIEW] Journal of Symbolic Logic 55 (1):347-348.
    Translate
     
     
    Export citation  
     
    My bibliography  
  43. Martin Davis (1982). Review: W. A. J. Luxemburg, A. Robinson, Selected Papers of Abraham Robinson: Nonstandard Analysis and Philosophy. [REVIEW] Journal of Symbolic Logic 47 (1):203-210.
     
    Export citation  
     
    My bibliography  
  44. Martin Davis (1953). Review: Paul C. Rosenbloom, The Elements of Mathematical Logic. [REVIEW] Journal of Symbolic Logic 18 (3):277-280.
     
    Export citation  
     
    My bibliography  
  45. Martin Davis (1968). Review: E. W. Beth, Observations Concerning Computing, Deduction, and Heuristics. [REVIEW] Journal of Symbolic Logic 33 (1):118-118.
     
    Export citation  
     
    My bibliography  
  46.  2
    Martin Davis (1955). Review: John Myhill, Criteria of Constructibility for Real Numbers. [REVIEW] Journal of Symbolic Logic 20 (2):178-178.
    Direct download  
     
    Export citation  
     
    My bibliography  
  47.  1
    Martin Davis (1954). Review: Andrzej Mostowski, An Undecidable Arithmetical Statement. [REVIEW] Journal of Symbolic Logic 19 (2):118-119.
    Direct download  
     
    Export citation  
     
    My bibliography  
  48.  1
    Martin Davis (1959). Review: Alfred Tarski, Undecidable Theories. [REVIEW] Journal of Symbolic Logic 24 (2):167-169.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49.  1
    Martin Davis (1966). Review: M. L. Minsky, Size and Structure of Universal Turing Machines Using Tag Systems. [REVIEW] Journal of Symbolic Logic 31 (4):655-655.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50.  1
    Martin Davis (1951). Review: W. V. Quine, On Decidability and Completeness. [REVIEW] Journal of Symbolic Logic 16 (1):76-76.
1 — 50 / 168