Set Theory and Logic


Refutation of Recursive Enumerability and Elementary Frame Definability in Predicate Modal Logic

Authors: Colin James III

We evaluate two equations as not tautologous to show the standard translation of a predicate model into a logic language fails. We evaluate five equations as not tautologous, with the last result as contradictory, to show a class defined to contain frames fails to satisfy a classical first-order formula or to claim logic system equivalency. The conjecture of recursive enumerability and elementary frame definability in predicate modal logic is refuted. These results form a non tautologous fragment of the universal logic VŁ4.

Comments: 4 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

Download: PDF

Submission history

[v1] 2019-11-25 10:11:25

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