ﻻ يوجد ملخص باللغة العربية
In quantum logic, introduced by Birkhoff and von Neumann, De Morgans Laws play an important role in the projection-valued truth value assignment of observational propositions in quantum mechanics. Takeutis quantum set theory extends this assignment to all the set-theoretical statements on the universe of quantum sets. However, Takeutis quantum set theory has a problem in that De Morgans Laws do not hold between universal and existential bounded quantifiers. Here, we solve this problem by introducing a new truth value assignment for bounded quantifiers that satisfies De Morgans Laws. To justify the new assignment, we prove the Transfer Principle, showing that this assignment of a truth value to every bounded ZFC theorem has a lower bound determined by the commutator, a projection-valued degree of commutativity, of constants in the formula. We study the most general class of truth value assignments and obtain necessary and sufficient conditions for them to satisfy the Transfer Principle, to satisfy De Morgans Laws, and to satisfy both. For the class of assignments with polynomially definable logical operations, we determine exactly 36 assignments that satisfy the Transfer Principle and exactly 6 assignments that satisfy both the Transfer Principle and De Morgans Laws.
In 1981, Takeuti introduced set theory based on quantum logic by constructing a model analogous to Boolean-valued models for Boolean logic. He defined the quantum logical truth value for every sentence of set theory. He showed that equality axioms do
We show that the classifying topos for the theory of fields does not satisfy De Morgans law, and we identify its largest dense De Morgan subtopos as the classifying topos for the theory of fields of nonzero characteristic which are algebraic over their prime fields.
Gaisi Takeuti introduced Boolean valued analysis around 1974 to provide systematic applications of Boolean valued models of set theory to analysis. Later, his methods were further developed by his followers, leading to solving several open problems i
The $omega$-power of a finitary language L over a finite alphabet $Sigma$ is the language of infinite words over $Sigma$ defined by L $infty$ := {w 0 w 1. .. $in$ $Sigma$ $omega$ | $forall$i $in$ $omega$ w i $in$ L}. The $omega$-powers appear very na
The transfer of a quantum state between distant nodes in two-dimensional networks, is considered. The fidelity of state transfer is calculated as a function of the number of interactions in networks that are described by regular graphs. It is shown t