Search Paper
  • Home
  • Login
  • Categories
  • Post URL
  • Academic Resources
  • Contact Us

 

GÖDEL THEOREM IS INVALID

google+
Views: 107                 

Author :  J. Ulisses Ferreira

Affiliation :  Trv Pirapora 36 Costa Azul, 41770-220, Salvador

Country :  Brazil

Category :  Computer Science & Information Technology

Volume, Issue, Month, Year :  7, 8, June, 2017

Abstract :


This short and informal article shows that there exists some deductive system that proves that arithmetic is both sound and complete. First, it shows that there exists some four-valued logical system that plays the same role, by presenting a four-valued logic and informally introducing a four-valued Prolog programming language. Finally, it observes that some Boolean formal system can also prove that arithmetic is both sound and complete.

Keyword :  Gödel, incompleteness theorem, four-valued logic, logic, computability theory, philosophy of computer science

Journal/ Proceedings Name :  Computer Science & Information Technology

URL :  https://airccj.org/CSCP/vol7/csit77002.pdf

User Name : alex
Posted 19-06-2020 on 22:03:41 AEDT



Related Research Work

  • An Adaptive And Smart System For Parental Control On Digital Games
  • Intelligent System For Solving Problems Of Veterinary Medicine On The Example Of Dairy Farms
  • A Diet Control And Fitness Assistant Application Using Deep Learning-based Image Classification
  • 2d Image Features Detector And Descriptor Selection Expert System

About Us | Post Cfp | Share URL Main | Share URL category | Post URL
All Rights Reserved @ Call for Papers - Conference & Journals