{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T02:55:51Z","timestamp":1794538551840,"version":"4.9.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319418414","type":"print"},{"value":"9783319418421","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41842-1_10","type":"book-chapter","created":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T12:01:15Z","timestamp":1485950475000},"page":"255-283","source":"Crossref","is-referenced-by-count":2,"title":["Banishing Ultrafilters from Our Consciousness"],"prefix":"10.1007","author":[{"given":"Domenico","family":"Cantone","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eugenio G.","family":"Omodeo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,1,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Anastasio, S. (Coordinating\u00a0Editor) (2015). In memory of Jacob Schwartz. Notices of the AMS, 473\u2013490.","DOI":"10.1090\/noti1246"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ballantyne, A. M. (1991). The Metatheorist: Automatic proofs of theorems in analysis using non-standard techniques, Part II. In R. S. Boyer (Ed.), Automated reasoning: Essays in Honor of Woody Bledsoe (pp. 61\u201375). Dordrecht, The Netherlands: Kluwer Academic.","DOI":"10.1007\/978-94-011-3488-0_3"},{"issue":"3","key":"10_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/322017.322018","volume":"24","author":"AM Ballantyne","year":"1977","unstructured":"Ballantyne, A. M., & Bledsoe, W. W. (1977). Automatic proofs of theorems in analysis using nonstandard techniques. Journal of the ACM, 24(3), 353\u2013374.","journal-title":"Journal of the ACM"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Blass, A. (1978). Book reviews of Applied nonstandard analysis, by Martin Davis, Introduction to the theory of infinitesimals, by K. D. Stroyan and W. A. J. Luxemburg, and Foundations of infinitesimal calculus, by H. Jerome Keisler. Bull. Amer. Math. Soc., 84(1):34\u201341, 1978.","DOI":"10.1090\/S0002-9904-1978-14401-2"},{"issue":"1","key":"10_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(77)90012-1","volume":"9","author":"WW Bledsoe","year":"1977","unstructured":"Bledsoe, W. W. (1977). Non-resolution theorem proving. Artificial Intelligence, 9(1), 1\u201335.","journal-title":"Artificial Intelligence"},{"key":"10_CR6","unstructured":"Boldo, S., Lelay, C., & Melquiond, G. (2015). Formalization of real analysis: A survey of proof assistants and libraries. Mathematical Structures in Computer Science, 38 pp."},{"key":"10_CR7","unstructured":"Burstall, R., & Goguen, J. (1977). Putting theories together to make specifications. In R. Reddy (Ed.), Proceedings of the 5th International Joint Conference on Artificial Intelligence (pp. 1045\u20131058). Cambridge, MA."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Cantone, D., Omodeo, E.\u00a0G., & Policriti, A. (2001). Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets. Monographs in Computer Science. Springer.","DOI":"10.1007\/978-1-4757-3452-2"},{"key":"10_CR9","unstructured":"Ceterchi, R., Omodeo, E.\u00a0G., & Tomescu, A.\u00a0I. (2014). The representation of Boolean algebras in the spotlight of a proof checker. In L.\u00a0Giordano, V.\u00a0Gliozzi, & G.\u00a0L. Pozzato, (Eds.), CILC 2014: Italian Conference on Computational Logic, volume 1195 http:\/\/ceur-ws.org\/Vol-1195\/ , ISSN 1613-0073, pp. 287\u2013301. CEUR Workshop Proceedings, July 2014."},{"key":"10_CR10","unstructured":"Chinlund, T. J., Davis, M., Hinman, P.\u00a0G., & McIlroy, M.\u00a0D. (1964). Theorem-proving by matching. Technical report, Bell Telephone Laboratories, Incorporated, Murray Hill, New Jersey."},{"key":"10_CR11","unstructured":"Cohen, P. J. (1966). Set Theory and the Continuum Hypothesis. Mathematics Lecture Note Series. Reading, Massachusetts: W.\u00a0A.\u00a0Benjamin, Inc."},{"key":"10_CR12","unstructured":"Davis, M. (1960). A program for Presburger\u2019s algorithm. Summaries of talks presented at the Summer Institute of Symbolic Logic in 1957 at Cornell University (vol.\u00a02, pp. 215\u2013223). Princeton, NJ. Communications Research Division, Institute for Defense Analyses. Reprinted as \u201cA computer program for Presburger\u2019s algorithm\u201d in [36, pp. 41\u201348]."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Davis, M. (1963). Eliminating the irrelevant from mechanical proofs. Proceedings of Symposia in Applied Mathematics (vol.\u00a015, pp. 15\u201330). Providence, RI: AMS. Reprinted in [36, pp. 315\u2013330]; Russian transl. in Kiberneticheskiy sbornik. Novaya seriya, 7, 1970, pp. 160\u2013179.","DOI":"10.1090\/psapm\/015\/0170497"},{"key":"10_CR14","unstructured":"Davis, M. (1977). Applied nonstandard analysis. Wiley. Reprinted with corrections Dover, 2005. Russian translation, Izdatel\u2019stvo Mir, Moscow 1980. Japanese translation 1977."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Davis, M. (2001). The early history of automated deduction. In J.\u00a0A. Robinson & A Voronkov, (Eds.), Handbook of Automated Reasoning (pp. 3\u201315). Elsevier and MIT Press.","DOI":"10.1016\/B978-044450813-3\/50003-5"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Davis, M. (2013). Jack Schwartz meets Karl Marx. In [22, pp. 23\u201337].","DOI":"10.1007\/978-1-4471-4282-9_3"},{"issue":"4","key":"10_CR17","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1093\/logcom\/1.4.431","volume":"1","author":"M Davis","year":"1991","unstructured":"Davis, M., & Fechter, R. (1991). A free variable version of the first-order predicate calculus. Journal of Logic and Computation, 1(4), 431\u2013451.","journal-title":"Journal of Logic and Computation"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1038\/scientificamerican0672-78","volume":"226","author":"M Davis","year":"1972","unstructured":"Davis, M., & Hersh, R. (1972). Nonstandard analysis. Scientific American, 226, 78\u201386.","journal-title":"Scientific American"},{"key":"10_CR19","unstructured":"Davis, M., & Putnam, H. (1958). Feasible computational methods in the propositional calculus. Technical report, Rensselaer Polytechnic Institute, Research Division, Troy, New York."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. Journal of the ACM, 7(3):201\u2013215. Reprinted in [36, pp. 125\u2013139].","DOI":"10.1145\/321033.321034"},{"key":"10_CR21","unstructured":"Davis, M., & Schonberg, E. (2011). Jacob Theodore Schwartz 1930\u20132009. Biographical Memoirs of the National Academy of Sciences,19 pp."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Davis, M., & Schonberg, E. (Eds.). (2013). From Linear Operators to Computational Biology: Essays in Memory of Jacob T. Schwartz. Springer.","DOI":"10.1007\/978-1-4471-4282-9"},{"key":"10_CR23","unstructured":"Davis, M. & Schwartz, J. T. (1977). Correct-program technology\/Extensibility of verifiers\u2014Two papers on Program Verification with Appendix of Edith Deak. Technical Report No. NSO-12, Courant Institute of Mathematical Sciences, New York University."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Davis, M. & Schwartz, J. T. (1979). Metamathematical extensibility for theorem verifiers and proof-checkers. Computers and Mathematics with Applications, 5, 217\u2013230. Also in [25, pp.\u00a0120\u2013146].","DOI":"10.1016\/0898-1221(79)90044-0"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Davis, M., Logemann, G., & Loveland, D. W. (1962). A machine program for theorem-proving. Communications of the Association for Computing. Machinery, 5(7), 394\u2013397.","DOI":"10.1145\/368273.368557"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Fleuriot, J.\u00a0D. (2000). On the mechanization of real analysis in Isabelle\/HOL. In M. Aagaard & J. Harrison, (Eds.), Theorem Proving in Higher Order Logics, 13th International Conference, TPHOLs 2000, Portland, Oregon, USA, 14\u201318 August 2000, Proceedings, volume 1869 of Lecture Notes in Computer Science (pp. 145\u2013161). Springer.","DOI":"10.1007\/3-540-44659-1_10"},{"issue":"4","key":"10_CR27","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/A:1011908113514","volume":"27","author":"R Gamboa","year":"2001","unstructured":"Gamboa, R., & Kaufmann, M. (2001). Nonstandard analysis in ACL2. Journal of Automated Reasoning, 27(4), 323\u2013351.","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR28","unstructured":"Keisler, H.\u00a0J. (1976). Foundations of infinitesimal calcuus. Boston, MA: Prindle, Weber & Schmidt, Inc."},{"key":"10_CR29","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0898-1221(82)90042-6","volume":"8","author":"EG Omodeo","year":"1982","unstructured":"Omodeo, E. G. (1982). The Linked Conjunct method for automatic deduction and related search techniques. Computers and Mathematics with Applications, 8, 185\u2013203.","journal-title":"Computers and Mathematics with Applications"},{"key":"10_CR30","unstructured":"Omodeo, E.\u00a0G. (2012). The Ref proof-checker and its \u201ccommon shared scenario\u201d. In M. Davis & E. Schonberg, (Eds.), From Linear Operators to Computational Biology: Essays in Memory of Jacob T. Schwartz (pp. 121\u2013131). Springer."},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Omodeo, E.\u00a0G., & Schwartz, J.\u00a0T. (2002). A \u2018Theory\u2019 mechanism for a proof-verifier based on first-order set theory. In A.\u00a0Kakas & F.\u00a0Sadri, (Eds.), Computational logic: Logic programming and beyond\u2014Essays in honour of Bob Kowalski, part II (vol. 2408, pp. 214\u2013230). Springer.","DOI":"10.1007\/3-540-45632-5_9"},{"issue":"1","key":"10_CR32","first-page":"85","volume":"63","author":"EG Omodeo","year":"2008","unstructured":"Omodeo, E. G., & Tomescu, A. I. (2008). Using \u00c6tnaNova to formally prove that the Davis-Putnam satisfiability test is correct. Le Matematiche, 63(1), 85\u2013105.","journal-title":"Le Matematiche"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Policriti, A. (1988). Decision procedures for elementary sublanguages of set theory. IX. Unsolvability of the decision problem for a restricted class of the $$\\Delta _0$$ -formulas in set theory. Communications on Pure and Applied Mathematics 41(2), 221\u2013251.","DOI":"10.1002\/cpa.3160410206"},{"key":"10_CR34","unstructured":"Robinson, J. A. (1967). Review: Martin Davis, Eliminating the irrelevant from mechanical proofs. Journal of Symbolic Logic, 32(1), 118\u2013119."},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Schwartz, J.\u00a0T., Cantone, D., & Omodeo, E.\u00a0G. (2011). Computational logic and set theory\u2014Applying formalized logic to analysis. Springer.","DOI":"10.1007\/978-0-85729-808-9"},{"key":"10_CR36","volume-title":"Automation of reasoning 1: Classical papers on computational logic 1957\u20131966","year":"1983","unstructured":"Siekmann, J., & Wrightson, G. (Eds.). (1983). Automation of reasoning 1: Classical papers on computational logic 1957\u20131966. Berlin, Heidelberg: Springer."},{"issue":"45","key":"10_CR37","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s2-45.1.161","volume":"2","author":"AM Turing","year":"1939","unstructured":"Turing, A. M. (1939). Systems of logic based on ordinals. Proceedings of the London Mathematical Society, 2(45), 161\u2013228.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"10_CR38","unstructured":"Weyhrauch, R.\u00a0W. (1977). A users manual for FOL. Technical Report MEMO AIM-235.1, Stanford University, Stanford, CA, USA."},{"key":"10_CR39","unstructured":"Yarmush, D.\u00a0L. (1976). The Linked Conjunct and other algorithms for mechanical theorem-proving. Technical Report IMM 412, Courant Institute of Mathematical Sciences, New York University."}],"container-title":["Outstanding Contributions to Logic","Martin Davis on Computability, Computational Logic, and Mathematical Foundations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41842-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T21:08:26Z","timestamp":1692652106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41842-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319418414","9783319418421"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41842-1_10","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-41842-1","asserted-by":"object"}]},"ISSN":["2211-2758","2211-2766"],"issn-type":[{"value":"2211-2758","type":"print"},{"value":"2211-2766","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}