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
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
For More Details : https://airccj.org/CSCP/vol7/csit77002.pdf