Set Theory and Logic

   

Refutation of the Boone-Rogers Theorem

Authors: Colin James III

The Boone-Rogers theorem states that the uniform word problem for the class of all finitely presented groups with solvable word problem is unsolvable. We show that is not tautologous. We further show that a universal, solvable word problem group is tautologous. The former forms a non tautologous fragment of the universal logic VŁ4.

Comments: 2 Pages. © Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at ersatz-systems.com.

Download: PDF

Submission history

[v1] 2019-06-29 05:45:03

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