Authors: Colin James III
Solovay’s arithmetical completeness theorem for provability logic is refuted by showing the following are not tautologous: Löb's rule as an inference; Gödel's logic system (GL); Gödel's second incompleteness theorem; inconsistency claims of Peano arithmetic (PA); and inability to apply semantical completeness to results which are not contradictory and which are not tautologous.
Comments: 3 Pages. © Copyright 2018 by Colin James III All rights reserved. Note that comments on Disqus are not forwarded or read, so respond to author's email address: info@cec-services dot com.
[v1] 2018-06-19 14:16:30
Unique-IP document downloads: 15 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.