Authors: Robert A. Herrmann
Relative to universal logic, it is demonstrated how useful it is to utilize general logic-systems to investigate finite consequences operators (operations). Among many other examples relative to the lattice of finite consequence operators, a general characterization for the lattice-theoretic supremum for a nonempty collection of finite consequence operators is given. Further, it is shown that for any denumerable language there is a rather simple collection of finite consequence operators and for a propositional language, three simple modifications to the finitary rule of inference that demonstrate that the lattice of finite consequence operators is not meet-complete.
Comments: 19 Pages.
Unique-IP document downloads: 156 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.