Is Gödelian Model-based Deductive Reasoning Computational?

  • BRINGSJORD S
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

I advance herein the view that the reasoning required to prove Godelian incompleteness theorems is not, contrary to what some have said, achieved by today's automated theorem provers.

Cite

CITATION STYLE

APA

BRINGSJORD, S. (1998). Is Gödelian Model-based Deductive Reasoning Computational? Philosophica, 61(1). https://doi.org/10.21825/philosophica.82314

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free