Set Theory and Logic


Refutation of Bitstring and Question-Answer Semantics

Authors: Colin James III

We evaluate bitstring semantics and its follow-on by partition. Its ordered set of exhaustive predicates is not bivalent but a probabilistic vector space. Its calculus of relations is not tautologous. Hence its broader framework of question-answer semantics (QAS) is not tautologous. The conjecture of “generalizing the Aristotelian square within one common gathering” is denied. What is affirmed is the Meth8 corrected, modern, revised square of opposition is a square, to mean the following conjectures are probabilistic vector spaces: collapsed number line of opposition; non-standard quadrilateral of oppositions; and colored square of oppositions. Bitstring semantics and the extended QAS form a non tautologous fragment of the universal logic VŁ4.

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

Download: PDF

Submission history

[v1] 2019-09-10 16:35:12

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