Results 21 to 30 of about 428,865 (120)
Sequent Calculus Representations for Quantum Circuits [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 When considering a sequent-style proof system for quantum programs, there are certain elements of quantum mechanics that we may wish to capture, such as phase, dynamics of unitary transformations, and measurement probabilities. Traditional quantum logics
Cameron Beebe
doaj +1 more source
Kadison’s antilattice theorem for a synaptic algebra
Demonstratio Mathematica, 2018 We prove that if A is a synaptic algebra and the orthomodular lattice P of projections in A is complete, then A is a factor if and only if A is an antilattice.We also generalize several other results of R.
Foulis David J., Pulmannová Sylvia
doaj +1 more source
On interval homogeneous orthomodular lattices [PDF]
, 2001 summary:An orthomodular lattice $L$ is said to be interval homogeneous (resp. centrally interval homogeneous) if it is $\sigma$-complete and satisfies the following property: Whenever $L$ is isomorphic to an interval, $[a,b]$, in $L$ then $L$ is ...
PTAK P. +5 more
core +1 more source
A Note of Filters in Effect Algebras
Chinese Journal of Mathematics, Volume 2013, Issue 1, 2013., 2013 We investigate relations of the two classes of filters in effect algebras (resp., MV‐algebras). We prove that a lattice filter in a lattice ordered effect algebra (resp., MV‐algebra) E does not need to be an effect algebra filter (resp., MV‐filter). In general, in MV‐algebras, every MV‐filter is also a lattice filter.
Biao Long Meng +3 more
wiley +1 more source
On Intuitionistic Fuzzy Context‐Free Languages
Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013 Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context‐free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs). Then we investigate algebraic characterization of intuitionistic fuzzy recognizable languages including decomposition form and representation ...
Jianhua Jin +3 more
wiley +1 more source
The Brooks-Jewett theorem on an orthomodular lattice [PDF]
, 1991 The Brooks-Jewett convergence theorem for semigroup valued functions defined on an orthomodular lattice is proved. The proof is obtained by means of a lemma which allows the study of a sequence of finite additive and s-bounded functions defined on an ...
d'Andrea, Anna Bruna, de Lucia, Paolo
core +1 more source
Orthomodular lattices with fully nontrivial commutators [PDF]
, 1992 summary:An orthomodular lattice $L$ is said to have fully nontrivial commutator if the commutator of any pair $x,y \in L$ is different from zero. In this note we consider the class of all orthomodular lattices with fully nontrivial commutators.
Matoušek, Milan
core +1 more source
Conrad’s Partial Order on P.Q.-Baer *-Rings
Discussiones Mathematicae - General Algebra and Applications, 2018 We prove that a p.q.-Baer *-ring forms a pseudo lattice with Conrad’s partial order and also characterize p.q.-Baer *-rings which are lattices. The initial segments of a p.q.-Baer *-ring with the Conrad’s partial order are shown to be an orthomodular ...
Khairnar Anil, Waphare B.N.
doaj +1 more source
Advances in Mathematical Physics, Volume 2012, Issue 1, 2012., 2012 Most quantum logics do not allow for a reasonable calculus of conditional probability. However, those ones which do so provide a very general and rich mathematical structure, including classical probabilities, quantum mechanics, and Jordan algebras. This structure exhibits some similarities with Alfsen and Shultz′s noncommutative spectral theory, but ...
Gerd Niestegge, B. G. Konopelchenko
wiley +1 more source
A Comparison of Implications in Orthomodular Quantum Logic—Morphological Analysis of Quantum Logic
International Journal of Mathematics and Mathematical Sciences, Volume 2012, Issue 1, 2012., 2012 Morphological operators are generalized to lattices as adjunction pairs (Serra, 1984; Ronse, 1990; Heijmans and Ronse, 1990; Heijmans, 1994). In particular, morphology for set lattices is applied to analyze logics through Kripke semantics (Bloch, 2002; Fujio and Bloch, 2004; Fujio, 2006).
Mitsuhiko Fujio, Shigeru Kanemitsu
wiley +1 more source