Mathematics of totalities: An alternative to mathematics of sets (Q1117207): Difference between revisions

A propositional logic TT with the connectives \(\wedge\), \(\vee\), \(\cap\), {\#}, \(\neg\) is considered. As truth-values the collection of nonempty subsets of some set \(\Omega\) are taken. They are called totalities. (A possible interpretation is the ``volume'' of the notion.) The connective {\#} is called plexis. \(\sigma\) {\#}\(\tau\) is true (equal to \(\Omega)\) iff any element of totality \(\sigma\) has a nonempty intersection with any elementy of \(\tau\). If not, \(\sigma\) {\#}\(\tau\) \(=\emptyset\). An imbedding of first-order classical predicate logic in TT is described.