On the Unusual Effectiveness of Logic in Computer Science

DOI10.2307/2687775zbMath0979.03033OpenAlexW2107399696MaRDI QIDQ2736585

Robert Harper, Victor Vianu, Phokion G. Kolaitis, Joseph Y. Halpern, Moshe Y. Vardi, Neil Immerman

Publication date: 10 September 2001

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.202.230

zbMATH Keywords

surveycomputational complexityfirst-order logicprogramming languagemulti-agent systemstype theoryepistemic logiclogic in computer sciencedatabase query languageautomated design verificationreason about knowledge

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (7)

Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language ⋮ The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself ⋮ Three fundamental misconceptions of Artificial Intelligence ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ Logical Foundations of XML and XQuery ⋮ Interpolation in computing science: The semantics of modularization ⋮ Frame constructions, truth invariance and validity preservation in many-valued modal logic

Uses Software

• SPIN
• CESAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of quantifiers is better than number of tape cells
• Upper and lower bounds for first order expressibility
• Symbolic model checking: \(10^{20}\) states and beyond
• Reasoning about infinite computations
• Combinatory logic. Vol. II
• The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
• Knowledge and common knowledge in a distributed environment
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Relational queries computable in polynomial time
• Languages that Capture Complexity Classes
• Nondeterministic Space is Closed under Complementation
• Theories of Programming Languages
• A relational model of data for large shared data banks
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• A note on the Entscheidungsproblem

This page was built for publication: On the Unusual Effectiveness of Logic in Computer Science