Skip to main content Accessibility help
×
Home
Hostname: page-component-59b7f5684b-569ts Total loading time: 0.234 Render date: 2022-10-03T21:09:32.160Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true

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
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)

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Book Review
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, 13671405.CrossRefGoogle Scholar
Barendregt, H. 1991. Introduction to generalized type systems. Journal of Functional Programming 1, 2, 125154.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, 9398.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, 3888.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, 502525.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 HyperSlateand 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, 1102.CrossRefGoogle Scholar
Grabowski, A., Kornilowicz, A. and Naumowicz, A. 2010. Mizar in a nutshell. Journal of Formalized Reasoning 3, 2, 153245.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, 772773.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, 163172.Google Scholar
1
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

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
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

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
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

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
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *