2-valued morphism

Last updated

In mathematics, a 2-valued morphism [1] is a homomorphism that sends a Boolean algebra B onto the two-element Boolean algebra 2 = {0,1}. It is essentially the same thing as an ultrafilter on B, and, in a different way, also the same things as a maximal ideal of B. 2-valued morphisms have also been proposed as a tool for unifying the language of physics. [2]

Contents

2-valued morphisms, ultrafilters and maximal ideals

Suppose B is a Boolean algebra.

Physics

If the elements of B are viewed as "propositions about some object", then a 2-valued morphism on B can be interpreted as representing a particular "state of that object", namely the one where the propositions of B which are mapped to 1 are true, and the propositions mapped to 0 are false. Since the morphism conserves the Boolean operators (negation, conjunction, etc.), the set of true propositions will not be inconsistent but will correspond to a particular maximal conjunction of propositions, denoting the (atomic) state. (The true propositions form an ultrafilter, the false propositions form a maximal ideal, as mentioned above.)

The transition between two states s1 and s2 of B, represented by 2-valued morphisms, can then be represented by an automorphism f from B to B, such that s2 o f = s1.

The possible states of different objects defined in this way can be conceived as representing potential events. The set of events can then be structured in the same way as invariance of causal structure, or local-to-global causal connections or even formal properties of global causal connections.

The morphisms between (non-trivial) objects could be viewed as representing causal connections leading from one event to another one. For example, the morphism f above leads form event s1 to event s2. The sequences or "paths" of morphisms for which there is no inverse morphism, could then be interpreted as defining horismotic or chronological precedence relations. These relations would then determine a temporal order, a topology, and possibly a metric.

According to, [2] "A minimal realization of such a relationally determined space-time structure can be found". In this model there are, however, no explicit distinctions. This is equivalent to a model where each object is characterized by only one distinction: (presence, absence) or (existence, non-existence) of an event. In this manner, "the 'arrows' or the 'structural language' can then be interpreted as morphisms which conserve this unique distinction". [2]

If more than one distinction is considered, however, the model becomes much more complex, and the interpretation of distinction states as events, or morphisms as processes, is much less straightforward.

Related Research Articles

Boolean algebra (structure) Algebraic structure modeling logical operations

In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations. A Boolean algebra can be seen as a generalization of a power set algebra or a field of sets, or its elements can be viewed as generalized truth values. It is also a special case of a De Morgan algebra and a Kleene algebra.

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions.

Ultrafilter Maximal proper filter

In the mathematical field of order theory, an ultrafilter on a given partially ordered set is a certain subset of namely a maximal filter on that is, a proper filter on that cannot be enlarged to a bigger proper filter on

In commutative algebra, the prime spectrum of a ring R is the set of all prime ideals of R, and is usually denoted by ; in algebraic geometry it is simultaneously a topological space equipped with the sheaf of rings .

Hyperreal number Element of a nonstandard model of the reals, which can be infinite or infinitesimal

In mathematics, the system of hyperreal numbers is a way of treating infinite and infinitesimal quantities. The hyperreals, or nonstandard reals, *R, are an extension of the real numbers R that contains numbers greater than anything of the form

In logic and mathematics, a truth value, sometimes called a logical value, is a value indicating the relation of a proposition to truth.

In mathematics, a Heyting algebra is a bounded lattice equipped with a binary operation a → b of implication such that ≤ b is equivalent to c ≤. From a logical standpoint, A → B is by this definition the weakest proposition for which modus ponens, the inference rule A → B, A ⊢ B, is sound. Like Boolean algebras, Heyting algebras form a variety axiomatizable with finitely many equations. Heyting algebras were introduced by Arend Heyting (1930) to formalize intuitionistic logic.

In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals. A variation of this statement for filters on sets is known as the ultrafilter lemma. Other theorems are obtained by considering different mathematical structures with appropriate notions of ideals, for example, rings and prime ideals, or distributive lattices and maximal ideals. This article focuses on prime ideal theorems from order theory.

In mathematics, a scheme is a mathematical structure that enlarges the notion of algebraic variety in several ways, such as taking account of multiplicities and allowing "varieties" defined over any commutative ring.

In category theory, a branch of abstract mathematics, an equivalence of categories is a relation between two categories that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics. Establishing an equivalence involves demonstrating strong similarities between the mathematical structures concerned. In some cases, these structures may appear to be unrelated at a superficial or intuitive level, making the notion fairly powerful: it creates the opportunity to "translate" theorems between different kinds of mathematical structures, knowing that the essential meaning of those theorems is preserved under the translation.

In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different notion. Ideals are of great importance for many constructions in order and lattice theory.

Laws of Form is a book by G. Spencer-Brown, published in 1969, that straddles the boundary between mathematics and philosophy. LoF describes three distinct logical systems:

In abstract algebra, an interior algebra is a certain type of algebraic structure that encodes the idea of the topological interior of a set. Interior algebras are to topology and the modal logic S4 what Boolean algebras are to set theory and ordinary propositional logic. Interior algebras form a variety of modal algebras.

In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum. Complete Boolean algebras are used to construct Boolean-valued models of set theory in the theory of forcing. Every Boolean algebra A has an essentially unique completion, which is a complete Boolean algebra containing A such that every element is the supremum of some subset of A. As a partially ordered set, this completion of A is the Dedekind–MacNeille completion.

In mathematical logic, a Boolean-valued model is a generalization of the ordinary Tarskian notion of structure from model theory. In a Boolean-valued model, the truth values of propositions are not limited to "true" and "false", but instead take values in some fixed complete Boolean algebra.

A Boolean-valued function is a function of the type f : X → B, where X is an arbitrary set and where B is a Boolean domain, i.e. a generic two-element set,, whose elements are interpreted as logical values, for example, 0 = false and 1 = true, i.e., a single bit of information.

In mathematics and abstract algebra, a Boolean domain is a set consisting of exactly two elements whose interpretations include false and true. In logic, mathematics and theoretical computer science, a Boolean domain is usually written as {0, 1}, or

Boolean algebra is a mathematically rich branch of abstract algebra. Just as group theory deals with groups, and linear algebra with vector spaces, Boolean algebras are models of the equational theory of the two values 0 and 1. Common to Boolean algebras, groups, and vector spaces is the notion of an algebraic structure, a set closed under some operations satisfying certain equations.

In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and false, usually denoted 1 and 0, respectively. Instead of elementary algebra, where the values of the variables are numbers and the prime operations are addition and multiplication, the main operations of Boolean algebra are the conjunction (and) denoted as ∧, the disjunction (or) denoted as ∨, and the negation (not) denoted as ¬. It is thus a formalism for describing logical operations, in the same way that elementary algebra describes numerical operations.

References

  1. ↑ Fleischer, Isidore (1993), "A Boolean formalization of predicate calculus", Algebras and orders (Montreal, PQ, 1991), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol. 389, Kluwer Acad. Publ., Dordrecht, pp. 193–198, MR   1233791 .
  2. 1 2 3 Heylighen, Francis (1990). A Structural Language for the Foundations of Physics. Brussels: International Journal of General Systems 18, p. 93-112.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.