AIRCC's International Journal of Computer Science and Information Technology

Open Access Open Access  Restricted Access Subscription Access

A Note on Godel´s Theorem


Affiliations
1 Trv Pirapora 36 Costa Azul, 41770-220, Salvador, Brazil
 

This short and informal article shows that, although Godel's theorem is valid using classical logic, there exists some four-valued logical system that is able to prove that arithmetic is both sound and complete. This article also describes a four-valued Prolog in some informal, brief and intuitive manner.

Keywords

Godel, Incompleteness Theorem, Four-Valued Logic, Hilbert’s Program.
User
Notifications
Font Size

  • Godel, Kurt, (1931) Uber formal unentscheidbareSatze der Principia Mathematica und verwandterSysteme I. MonatsheftefürMathematikunPhysik, Vol. 38, pp173-198.

  • Ferreira, Ulisses (2000) uu for programming languages. ACM SIGPLAN Notices, 35(8): pp20-30.

  • Ferreira, Ulisses (2004) A five-valued logic and a system. Journal of Computer Science and Technology, 4(3): pp134-140, October.

  • Ferreira, Ulisses (2004) Uncertainty and a 7-valued logic. In Pradip Peter Dey, Mohammad N. Amin, and Thomas M. Gatton, editors, Proceedings of The 2nd International Conference on Computer Science and its Applications, pp 170-173, National University, San Diego, CA, USA, June.

  • Belnap Jr, Nuel, (1975) A useful four-valued logic. In J. Michael Dunn and George Epstein, editors, Proceedings of the Fifth International Symposium on Multiple-Valued Logic, Modern Uses of Multiple-Valued Logic, pp 8-37. Indiana University, D. Reidel Publishing Company.

  • Ferreira, Ulisses (2004) A prolog-like language for the internet. In Veljko Milutinovic, editor, Proceedings of IPSI CAITA-04, Purdue, Indiana, USA.

  • Reiter, R. (1978) On Closed World Data Bases in Logic and Data Bases, Plenum Press, New York, pp 55-76.

  • Clark, Keith (1978) Negation as Failure in Logic and Data Bases, Plenum Press, New York, pp 293-322.

  • Dung, P. M. & Mancarella P. (1996) Production Systems need Negation as Failure, Proceedings of the XIII National Conference on Artificial Intelligence, vol 2, AAAI Press and the MIT Press, pp 1242-1247.

  • Seipel, Dietmar (1998) Partial Evidential Stable Models for Disjunctive Deductive Databases, in Logic Programming and Knowledge Representation, Third International Workshop / LPKR’97, Lecture Notes in Artificial Intelligence, vol. 1471, Springer, New York, October, pp 66-83


Abstract Views: 262

PDF Views: 127




  • A Note on Godel´s Theorem

Abstract Views: 262  |  PDF Views: 127

Authors

J. Ulisses Ferreira
Trv Pirapora 36 Costa Azul, 41770-220, Salvador, Brazil

Abstract


This short and informal article shows that, although Godel's theorem is valid using classical logic, there exists some four-valued logical system that is able to prove that arithmetic is both sound and complete. This article also describes a four-valued Prolog in some informal, brief and intuitive manner.

Keywords


Godel, Incompleteness Theorem, Four-Valued Logic, Hilbert’s Program.

References