Hostname: page-component-84b7d79bbc-g7rbq Total loading time: 0 Render date: 2024-07-26T19:09:23.577Z Has data issue: false hasContentIssue false
  • English
  • Français

Fundamental Proof Methods in Computer Science: A Computer-Based Approach, by Arkoudas and Musser, The MIT Press, Cambridge, USA, ISBN 978-0-262-03553-8

Review products

Fundamental Proof Methods in Computer Science: A Computer-Based Approach, by Arkoudas and Musser, The MIT Press, Cambridge, USA, ISBN 978-0-262-03553-8

Published online by Cambridge University Press:  10 June 2020

SELMER BRINGSJORD  and
NAVEEN SUNDAR GOVINDARAJULU Open the ORCID record for NAVEEN SUNDAR GOVINDARAJULU [Opens in a new window]
SELMER BRINGSJORD
Affiliation:
Department of Cognitive Science, Rensselaer AI & Reasoning Lab, Rensselaer Polytechnic Institute, Troy, NY 12180, USA Department of Computer Science, Rensselaer AI & Reasoning Lab, Rensselaer Polytechnic Institute, Troy, NY 12180, USA, (e-mail:selmer.bringsjord@gmail.com)
NAVEEN SUNDAR GOVINDARAJULU
Affiliation:
Rensselaer AI & Reasoning Lab, Rensselaer Polytechnic Institute Troy, NY 12180, USA, (e-mail: naveensundarg@gmail.com)
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Book Review
Information
Theory and Practice of Logic Programming , Volume 21 , Issue 2 , March 2021 , pp. 283 - 290
Check for updates
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Arkoudas, K. 2001. Certified Computation. Technical Report AIM-2001-007, MIT AI Lab, https://www.ai.mit.eduwww.ai.mit.edu. April. ‘AIM’ abbreviates ‘AI Memo’.Google Scholar
Arkoudas, K. and Bringsjord, S. 2009. Vivid: An AI framework for heterogeneous problem solving. Artificial Intelligence 173, 15, 1367–1405.CrossRefGoogle Scholar
Barendregt, H. 1991. Introduction to generalized type systems. Journal of Functional Programming 1, 2, 125–154.CrossRefGoogle Scholar
Benzmüller, C. and Paleo, B. W. 2014. Automating Gödel’s ontological proof of God’s existence with higher-order automated theorem provers. In Proceedings of the European Conference on Artificial Intelligence 2014 (ECAI 2014), Schaub, T., Friedrich, G. and O’Sullivan, B., Eds. IOS Press, Amsterdam, The Netherlands, 93–98.Google Scholar
Bertot, Y. and Castéran, P. 2004. Interactive Theorem Proving and Program Development. Coq’Art: The Calculus of Inductive Constructions. CrossRefGoogle Scholar
Boolos, G. S., Burgess, J. P. and Jeffrey, R. C. 2003. Computability and Logic (Fourth Edition). Cambridge University Press, Cambridge, UK.Google Scholar
Bove, A., Krauss, A. and Sozeau, M. 2016. Partiality and recursion in interactive theorem provers–An overview. Mathematical Structures in Computer Science 26, 1, 38–88.CrossRefGoogle Scholar
Bringsjord, S. 2008. The logicist manifesto: At long last let logic-based AI become a field unto itself. Journal of Applied Logic 6, 4, 502–525.CrossRefGoogle Scholar
Bringsjord, S. 2019. Computer science as immaterial formal logic. In Philosophy & Technology.CrossRefGoogle Scholar
Bringsjord, S., Govindarajulu, N. S. and Taylor, J. 2019. Logic: A Modern Approach: Beginning Deductive Logic via HyperSlate™ and HyperGrader™. Motalen, Troy, NY. This is an e-book edition of January 15 2019. The book is accompanied by access to the HyperSlate™ and HyperGrader™ software systems.Google Scholar
Coquand, T. and Huet, G. 1989. The Coq Proof Assistant.Google Scholar
Girard, J. 1987. Linear logic. Theoretical Computer Science 50, 1, 1–102.CrossRefGoogle Scholar
Grabowski, A., Kornilowicz, A. and Naumowicz, A. 2010. Mizar in a nutshell. Journal of Formalized Reasoning 3, 2, 153–245.Google Scholar
Jedynak, W. 2013. Operational Semantics of Ltac. Ph.D. thesis, Master’S Thesis, Institute Of Computer Science, University Of Wroc Law.Google Scholar
Kaufmann, M. and Strother Moore, J. 1996. ACL2: An industrial strength version of Nqthm. In Proceedings of 11th Annual Conference on Computer Assurance. COMPASS’96. 23–34.Google Scholar
Owre, S., Rajan, S., Rushby, J. M., Shankar, N. and Srivas, M. 1996. PVS: Combining specification, proof checking, and model checking. In International Conference on Computer Aided Verification. Springer, 411–414.Google Scholar
Paulson, L. C. 1988. Isabelle: The next seven hundred theorem provers. In International Conference on Automated Deduction. Springer, 772–773.Google Scholar
Shapiro, S. 1991. Foundations Without Foundationalism: A Case for Second-Order Logic. Oxford University Press, Oxford, UK.Google Scholar
Simpson, S. 2010. Subsystems of Second Order Arithmetic. Cambridge University Press, Cambridge, UK. This is the 2nd edition.Google Scholar
Suppes, P. 1951. A set of independent axioms for extensive qualities. Portugaliae Mathematica 10, 4, 163–172.Google Scholar