{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:07:30Z","timestamp":1790680050059,"version":"4.1.0"},"reference-count":61,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,1,15]],"date-time":"2014-01-15T00:00:00Z","timestamp":1389744000000},"content-version":"unspecified","delay-in-days":4703,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Bull. symb. log."],"published-print":{"date-parts":[[2001,3]]},"abstract":"<jats:p>In 1960, E. P. Wigner, a joint winner of the 1963 Nobel Prize for Physics, published a paper titled <jats:italic>On the Unreasonable Effectiveness of Mathematics in the Natural Sciences<\/jats:italic> [61]. This paper can be construed as an examination and affirmation of Galileo's tenet that \u201cThe book of nature is written in the language of mathematics\u201d. To this effect, Wigner presented a large number of examples that demonstrate the effectiveness of mathematics in accurately describing physical phenomena. Wigner viewed these examples as illustrations of what he called <jats:italic>the empirical law of epistemology<\/jats:italic>, which asserts that the mathematical formulation of the laws of nature is both appropriate and accurate, and that mathematics is actually the <jats:italic>correct<\/jats:italic> language for formulating the laws of nature. At the same time, Wigner pointed out that the reasons for the success of mathematics in the natural sciences are not completely understood; in fact, he went as far as asserting that \u201c\u2026 the enormous usefulness of mathematics in the natural sciences is something bordering on the mysterious and there is no rational explanation for it.\u201d<\/jats:p>","DOI":"10.2307\/2687775","type":"journal-article","created":{"date-parts":[[2006,5,7]],"date-time":"2006-05-07T03:17:03Z","timestamp":1146971823000},"page":"213-236","source":"Crossref","is-referenced-by-count":49,"title":["On the Unusual Effectiveness of Logic in Computer Science"],"prefix":"10.1017","volume":"7","author":[{"given":"Joseph Y.","family":"Halpern","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Harper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil","family":"Immerman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Phokion G.","family":"Kolaitis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2014,1,15]]},"reference":[{"key":"S1079898600005825_ref015","volume-title":"Reasoning about knowledge","author":"Fagin","year":"1995"},{"key":"S1079898600005825_ref044","volume-title":"Intuitionistic type theory","author":"Martin-L\u00f6f","year":"1984"},{"key":"S1079898600005825_ref033","first-page":"334","volume-title":"Proceedings of the 6th IEEE Symposium on Structure in Complexity Theory","author":"Immerman","year":"1991"},{"key":"S1079898600005825_ref022","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79161"},{"key":"S1079898600005825_ref002","first-page":"209","volume-title":"Proceedings of the 23rd ACM Symposium on Theory of Computing","author":"Abiteboul","year":"1991"},{"key":"S1079898600005825_ref053","first-page":"261","article-title":"Der Wahrheitsbegriff in den formalisierten Sprachen","volume":"1","author":"Tarski","year":"1935","journal-title":"Studia Philosophica"},{"key":"S1079898600005825_ref009","volume-title":"Combinatory logic, Volume 2","author":"Curry","year":"1972"},{"key":"S1079898600005825_ref032","doi-asserted-by":"publisher","DOI":"10.1137\/0217058"},{"key":"S1079898600005825_ref018","volume-title":"Proofs and types","volume":"7","author":"Girard","year":"1989"},{"key":"S1079898600005825_ref006","doi-asserted-by":"publisher","DOI":"10.1145\/5397.5399"},{"key":"S1079898600005825_ref058","first-page":"332","volume-title":"Proceedings of the 1st symposium on logic in computer science","author":"Vardi","year":"1986"},{"key":"S1079898600005825_ref049","volume-title":"Tapsoft","author":"Reynolds","year":"1985"},{"key":"S1079898600005825_ref042","volume-title":"The theory of relational databases","author":"Maier","year":"1983"},{"key":"S1079898600005825_ref026","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"S1079898600005825_ref017","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"S1079898600005825_ref024","volume-title":"Cylindric algebras, Part I","author":"Henkin","year":"1971"},{"key":"S1079898600005825_ref048","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/3-540-11494-7_22","volume-title":"Proceedings of the 5th International Symposium on Programming","volume":"137","author":"Queille","year":"1981"},{"key":"S1079898600005825_ref045","volume-title":"Foundations for programming languages","author":"Mitchell","year":"1996"},{"key":"S1079898600005825_ref057","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60915-6_6"},{"key":"S1079898600005825_ref041","first-page":"97","volume-title":"Proceedings of the 13th ACM Symposium on Principles of Programming Languages","author":"Lichtenstein","year":"1985"},{"key":"S1079898600005825_ref005","doi-asserted-by":"publisher","DOI":"10.2307\/2269326"},{"key":"S1079898600005825_ref039","volume-title":"Computer aided verification of coordinating processes","author":"Kurshan","year":"1994"},{"key":"S1079898600005825_ref043","volume-title":"The logical basis for computer programming","author":"Manna","year":"1985"},{"key":"S1079898600005825_ref027","first-page":"479","volume-title":"To H. B. Curry: Essays in combinatory logic, lambda calculus and formalism","author":"Howard","year":"1980"},{"key":"S1079898600005825_ref012","volume-title":"Finite model theory","author":"Ebbinghaus","year":"1995"},{"key":"S1079898600005825_ref036","volume-title":"Categorical logic and type theory","volume":"141","author":"Jacobs","year":"1999"},{"key":"S1079898600005825_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"S1079898600005825_ref056","first-page":"137","volume-title":"Proceedings of the 14th ACM Symposium on Theory of Computing","author":"Vardi","year":"1982"},{"key":"S1079898600005825_ref040","volume-title":"The Verification Times","author":"Kurshan","year":"1997"},{"key":"S1079898600005825_ref008","volume-title":"Combinatory logic","author":"Curry","year":"1958"},{"key":"S1079898600005825_ref021","volume-title":"Operating systems: An advanced course","volume":"66","author":"Gray","year":"1978"},{"key":"S1079898600005825_ref031","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"S1079898600005825_ref014","first-page":"43","volume-title":"Complexity of computation","volume":"7","author":"Fagin","year":"1974"},{"key":"S1079898600005825_ref030","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80029-8"},{"key":"S1079898600005825_ref052","first-page":"181","volume-title":"ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"Tarditi","year":"1996"},{"key":"S1079898600005825_ref003","first-page":"1","volume-title":"Proceedings of the International Congress on Logic, Methodology and Philosophy of Science 1960","author":"B\u00fcchi","year":"1962"},{"key":"S1079898600005825_ref019","doi-asserted-by":"publisher","DOI":"10.1007\/BF01700692"},{"key":"S1079898600005825_ref025","volume-title":"Knowledge and belief","author":"Hintikka","year":"1962"},{"key":"S1079898600005825_ref023","doi-asserted-by":"publisher","DOI":"10.2307\/2321982"},{"key":"S1079898600005825_ref034","first-page":"1127","article-title":"Descriptive complexity: a logician's approach to computation","volume":"42","author":"Immerman","year":"1995","journal-title":"Notices of the American Mathematical Society"},{"key":"S1079898600005825_ref016","first-page":"35","article-title":"Sur quelques classifications des syst\u00e8mes de relations","volume":"1","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publ. Sci. Univ. Alger. S\u00e9r. A"},{"key":"S1079898600005825_ref046","volume-title":"Technical Report DAIMI\u2013FN\u201319","author":"Plotkin","year":"1981"},{"key":"S1079898600005825_ref013","doi-asserted-by":"publisher","DOI":"10.4064\/fm-49-2-129-141"},{"key":"S1079898600005825_ref020","volume-title":"Electronic Engineering Today","author":"Goering","year":"1997"},{"key":"S1079898600005825_ref035","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"S1079898600005825_ref037","first-page":"1074","volume-title":"Handbook of theoretical computer science","author":"Kanellakis","year":"1991"},{"key":"S1079898600005825_ref060","volume-title":"Descriptive complexity and finite models","author":"Vianu","year":"1997"},{"key":"S1079898600005825_ref011","volume-title":"The universal computer","author":"Davis","year":"2000"},{"key":"S1079898600005825_ref054","first-page":"230","article-title":"On computable numbers with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proceedings of the London Mathematical Society, Series 3"},{"key":"S1079898600005825_ref050","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626364"},{"key":"S1079898600005825_ref007","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"S1079898600005825_ref038","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19630090502"},{"key":"S1079898600005825_ref001","volume-title":"Foundations of databases","author":"Abiteboul","year":"1995"},{"key":"S1079898600005825_ref055","volume-title":"Principles of database and knowledge base systems","author":"Ullman","year":"1988"},{"key":"S1079898600005825_ref047","first-page":"46","volume-title":"Proceedings of the 18th IEEE Symposium on Foundation of Computer Science","author":"Pnueli","year":"1977"},{"key":"S1079898600005825_ref061","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160130102"},{"key":"S1079898600005825_ref010","first-page":"315","volume-title":"The universal Turing machine: A half-century survey","author":"Davis","year":"1988"},{"key":"S1079898600005825_ref051","volume-title":"Database system concepts","author":"Silberschatz","year":"1997"},{"key":"S1079898600005825_ref029","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90011-3"},{"key":"S1079898600005825_ref028","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90039-8"},{"key":"S1079898600005825_ref059","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1092"}],"container-title":["Bulletin of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1079898600005825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T20:16:18Z","timestamp":1557260178000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1079898600005825\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S1079898600005825"],"URL":"https:\/\/doi.org\/10.2307\/2687775","relation":{},"ISSN":["1079-8986","1943-5894"],"issn-type":[{"value":"1079-8986","type":"print"},{"value":"1943-5894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}