On the Unusual Effectiveness of Logic in Computer Science

  title={On the Unusual Effectiveness of Logic in Computer Science},
  author={Joseph Y. Halpern and Robert Harper and Neil Immerman and Phokion G. Kolaitis and Moshe Y. Vardi and Victor Vianu},
  journal={Bulletin of Symbolic Logic},
  pages={213 - 236}
In 1960, E. P. Wigner, a joint winner of the 1963 Nobel Prize for Physics, published a paper titled On the Unreasonable Effectiveness of Mathematics in the Natural Sciences [61]. This paper can be construed as an examination and affirmation of Galileo's tenet that “The book of nature is written in the language of mathematics”. To this effect, Wigner presented a large number of examples that demonstrate the effectiveness of mathematics in accurately describing physical phenomena. Wigner viewed… 

The Birth of Computer Science at Princeton in the 1930s

The “Turing machine” is the standard model for a simple yet universal com­ puting device, and Alan Turing’s 1936 paper “On computable numbers . . . ” (written while he was a fellow at Cambridge

The Advent of Recursion & Logic in Computer Science

It will be shown that several ideas from logic that did influence some computer pioneers, were primarily received indirectly and without full comprehension.

Alternative Logics : A Book Review ∗

A few years ago, Bill Gasarch, editor of the Book Review Column, sent me a copy of the book Alternative Logics: Do Sciences Need Them? [28], edited by Paul Weingartner, and asked if I was interested

Computer Science and Philosophy: In Search of a Nexus

  • U. M. Ishaaq
  • Philosophy
    IOP Conference Series: Materials Science and Engineering
  • 2019
This research aims to map and analyse the nexus between philosophy and computer science: ontological and epistemological, as well as axiological aspects. It is arguably known traditionally that

Formal Logic

  • Miguel Palomino
  • Philosophy
    Wiley Encyclopedia of Computer Science and Engineering
  • 2008
This trend started with a shift to a symbolic notation and artificial languages, and gradually evolved until, in 1933 with Tarski, it culminated with the withdrawal from an absolute notion of Truth and instead focused on the particular truths of concrete structures or models.

Specifying confidentiality

The Logic Column serves as a showcase of the many connections between logic and computer science, and to get a sense of the range of applications, consider the 2001 NSF/CISE Workshop on The Unusual Effectiveness of Logic in Computer Science.

Interpolation in computing science: the semantics of modularization

The Modularization Theorem, the Factorization Lemma and the Normal Form Theorem for module expressions can be proved in TA, and an algebra of theories TA is presented, with a nonstandard interpretation of the existential quantifier.

Seamless Composition and Integration : A Perspective on Formal Methods Research †

Focusing more narrowly on areas and domains of particular interest to us, the authors can propose at least two directions which, while complementary to the current state-of-the-art, are separate from and beyond the topics covered in this volume.

News Logic Column 10 Specifying Con dentiality

I would like to start my tenure as editor of the Logic Column by thanking Jon Riecke, who has edited this column since 1998, and make sure to have a look at the article by Buss et al.

Three fundamental misconceptions of Artificial Intelligence

  • Pei Wang
  • Computer Science
    J. Exp. Theor. Artif. Intell.
  • 2007
This paper analyses misconceptions about the limitations of Artificial Intelligence, and points out the common root of them: treating empirical reasoning as mathematical reasoning.



The Unreasonable Effectiveness of Mathematics.

Prologue. It is evident from the title that this is a philosophical discussion. I shall not apologize for the philosophy, though I am well aware that most scientists, engineers, and mathematicians

The Unreasonable Effectiveness of Mathematics in the Natural Sciences (reprint)

There is a story about two friends, who were classmates in high school, talking about their jobs. One of them became a statistician and was working on population trends. He showed a reprint to his

Combinatory logic

the equations derivable from the axioms of the theory. When this two-step algebraization has been carried out it is possible to reduce problems of validity in a first-order language to questions

The Universal Turing Machine: A Half-Century Survey

This book discusses Alan Turing's analysis of Computability, and major applications of It, and Turing Naturalized: Von Neumann's Unfinished Project.

A note on the Entscheidungsproblem

  • A. Church
  • Mathematics
    Journal of Symbolic Logic
  • 1936
It is shown that the general case of the Entscheidungsproblem is unsolvable in any system of symbolic logic which is adequate to a certain portion of arithmetic and is ω-consistent.

Descriptive Complexity

  • N. Immerman
  • Computer Science
    Graduate Texts in Computer Science
  • 1999
The core of the book is contained in Chapters 1 through 7, although even here some sections can be omitted according to the taste and interests of the instructor, and the remaining chapters are more independent of each other.

Computers and Intractability: A Guide to the Theory of NP-Completeness

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

Intuitionistic type theory

These lectures were given in Padova and Munich later in the same year as part of the meeting on Konstruktive Mengenlehre und Typentheorie which was organized in Munich by Prof. Helmut Schwichtenberg.

The Foundations of Computing

The aim in this paper is to summarise some of the results of a long-term investigation of the foundations of computer science and artificial intelligence.

Reasoning about knowledge

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed systems, artificial intelligence, and game theory.