We fix a Boolean subalgebra B of an orthomodular poset P and study the mappings s:P → [0,1] which respect the ordering and the orthocomplementation in P and which are additive on B. We call such functions B-states on P. We first show that every P possesses "enough" two-valued B-states. This improves the main result in [13], where B is the centre of P. Moreover, it allows us to construct a closure-space representation of orthomodular lattices. We do this in the third section. This result may also...
We present three results stating when a concrete (=set-representable) quantum logic with covering properties (generalization of compatibility) has to be a Boolean algebra. These results complete and generalize some previous results [3, 5] and answer partiallz a question posed in [2].
Together with increasing quality of print, available to normal users, the significance of following the typographical rules grows. These rules may seem to be purely aesthetical matter. However, most of them have practical meaning: they enable to reduce reader's effort needed for "decoding" the written text. This article deals with Czech typographical rules of using spaces.
Two solutions for repeating of operations and relations in line breakings are presented depending on the fact whether the relation or operation is given by a command or by a character.
The main result of this paper is Theorem 3.3: Every concrete logic (i.e., every set-representable orthomodular poset) can be enlarged to a concrete logic with a given automorphism group and with a given center. Since every sublogic of a concrete logic is concrete, too, and since not every state space of a (general) quantum logic is affinely homeomorphic to the state space of a concrete logic [8], our result seems in a sense the best possible. Further, we show that every group is an automorphism...
Download Results (CSV)