Set Theory and Logic

   

Refutation of Induction by Numerical Identity of (-1≤C≤1) = (C≤1)

Authors: Colin James III

We evaluate the numerical identity of (-1≤C≤1) = (C≤1). It is confirmed by induction in 1MM iterations not to have a counter example. However, the numerical identity as a logical equation is not tautologous. When mapped as an implication (-1≤C≤1) → (C≤1), it is tautologous. This experiment speaks to the fact that induction when defined as an implication is not tautologous not deduction when defined as an implication is tautologous. These conjectures form a non tautologous fragment of the universal logic VŁ4.

Comments: 2 Pages. © Copyright 2019 by Colin James III All rights reserved. Note that Disqus comments here are not read by the author; reply by email only to: info@cec-services dot com. Include a list publications for veracity. Updated abstract at ersatz-systems.com.

Download: PDF

Submission history

[v1] 2019-10-01 18:48:11

Unique-IP document downloads: 9 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.

comments powered by Disqus