Quasi-orthomodular Posets and Weak BCK-algebras

A quasi-orthomodular poset is defined to be a poset with 0 equipped with an orthogonality relation satisfying certain axioms. The goal of the paper is to compare such posets (also semilattices, nearlattices and lattices) with several other kinds of posets having an appropriate structure and already known in the literature: generalized orthomodular posets and lattices, generalized orthoalgebras, sectionally orthocomplemented, sectionally orthomodular and relatively orthocomplemented posets and meet semilattices, semi-orthomodular lattices, weak BCK-algebras.     

Effect algebras with the maximality property

The maximality property was introduced in orthomodular posets as a common generalization of orthomodular lattices and orthocomplete orthomodular posets. We show that various conditions used in the theory of effect algebras are stronger than the maximality property, clear up the connections between them and show some consequences of these conditions. In particular, we prove that a Jauch–Piron effect algebra with a countable unital set of states is an orthomodular lattice and that a unital set of Jauch–Piron states on an effect algebra with the maximality property is strongly order determining.     

A note on ideals in synaptic algebras

The notion of a synaptic algebra was introduced by David Foulis. Synaptic algebras unite the notions of an order-unit normed space, a special Jordan algebra, a convex effect algebra and an orthomodular lattice. In this note we study quadratic ideals in synaptic algebras which reflect its Jordan algebra structure. We show that projections contained in a quadratic ideal from a p-ideal in the orthomodular lattice of projections in the synaptic algebra and we find a characterization of those quadratic ideals which are generated by their projections.     

Universal state space embeddability of Jordan-Banach algebras

We study extensions of states between projection structures of JB algebras and generalized orthomodular posets. It is shown that projection orthoposet of a JB algebra admits the universal extension property if and only if the Gleason theorem is valid for . As a consequence we get that any positive Stone algebra-valued measure on projection lattice of a quotient of a JBW algebra without type direct summand extends to a positive measure on an arbitrary larger generalized orthomodular lattice.

     

Projections in a Synaptic Algebra

A synaptic algebra is an abstract version of the partially ordered Jordan algebra of all bounded Hermitian operators on a Hilbert space. We review the basic features of a synaptic algebra and then focus on the interaction between a synaptic algebra and its orthomodular lattice of projections. Each element in a synaptic algebra determines and is determined by a one-parameter family of projections—its spectral resolution. We observe that a synaptic algebra is commutative if and only if its projection lattice is boolean, and we prove that any commutative synaptic algebra is isomorphic to a subalgebra of the Banach algebra of all continuous functions on the Stone space of its boolean algebra of projections. We study the so-called range-closed elements of a synaptic algebra, prove that (von Neumann) regular elements are range-closed, relate certain range-closed elements to modular pairs of projections, show that the projections in a synaptic algebra form an M-symmetric orthomodular lattice, and give several sufficient conditions for modularity of the projection lattice.     

About the correspondences between dual heyting arrow lattices of a distributive lattice and its sublattices for relational biologic systems

Heyting and dual Heyting arrow operations relating non-comparable elements of finite relatively pseudo-complemented lattices being pseudo-Boolean algebras (L) gave place to new structures named Heyting arrow (L_F) and dual Heyting arrow lattices ( _F) (though sometimes they are only posets). They were used for analyzing qualitative relations in biological systems by means of isomorphisms relating the lattice elements with energy states identified through abstract relational concepts describing the system being represented.

This paper considers the problem of connecting the poset with the posets (κ) corresponding to the epimorphic images L_κ of a pseudo-Boolean lattice L.     

Subalgebras of Orthomodular Lattices

Sachs (Can J Math 14:451–460, 1962) showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as well as by its poset of Boolean subalgebras BSub(L). The domain BSub(L) has recently found use in an approach to the foundations of quantum mechanics initiated by Butterfield and Isham (Int J Theor Phys 37(11):2669–2733, 1998, Int J Theor Phys 38(3):827–859, 1999), at least in the case where L is the orthomodular lattice of projections of a Hilbert space, or von Neumann algebra. The results here may add some additional perspective to this line of work.     

Hypercontinuous Posets

The concepts of hypercontinuous posets and generalized completely continuous posets are introduced. It is proved that for a poset P the following three conditions are equivalent:(1) P is hypercontinuous;(2) the dual of P is generalized completely continuous;(3) the normal completion of P is a hypercontinuous lattice. In addition, the relational representation and the intrinsic characterization of hypercontinuous posets are obtained.     

Classification of the factorial functions of Eulerian binomial and Sheffer posets

We give a complete classification of the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with n!, the factorial function of the infinite Boolean algebra, or ²n−1, the factorial function of the infinite butterfly poset. We also classify the factorial functions for Eulerian Sheffer posets. An Eulerian Sheffer poset with binomial factorial function B(n)=n! has Sheffer factorial function D(n) identical to that of the infinite Boolean algebra, the infinite Boolean algebra with two new coatoms inserted, or the infinite cubical poset. Moreover, we are able to classify the Sheffer factorial functions of Eulerian Sheffer posets with binomial factorial function B(n)=²n−1 as the doubling of an upside-down tree with ranks 1 and 2 modified. When we impose the further condition that a given Eulerian binomial or Eulerian Sheffer poset is a lattice, this forces the poset to be the infinite Boolean algebra BX or the infinite cubical lattice . We also include several poset constructions that have the same factorial functions as the infinite cubical poset, demonstrating that classifying Eulerian Sheffer posets is a difficult problem.     

Synaptic algebras

A synaptic algebra is both a special Jordan algebra and a spectral order-unit normed space satisfying certain natural conditions suggested by the partially ordered Jordan algebra of bounded Hermitian operators on a Hilbert space. The adjective “synaptic”, borrowed from biology, is meant to suggest that such an algebra coherently “ties together” the notions of a Jordan algebra, a spectral order-unit normed space, a convex effect algebra, and an orthomodular lattice.     

Decomposition theorems in orthomodular posets: the problem of uniqueness

We provide some conditions which are equivalent to the uniqueness of Hewitt-Yosida-type decomposition and Lebesgue-type decomposition for real valued additive functions defined on orthomodular posets.

     

Products of orthogonal projections

We give a characterization of operators on a separable Hilbert space of norm less than one that can be represented as products of orthogonal projections and give an estimate on the number of factors. We also describe the norm closure of the set of all products of orthogonal projections.

     

Quasicontinuity of Posets via Scott Topology and Sobrification

In this paper, posets which may not be dcpos are considered. In terms of the Scott topology on posets, the new concept of quasicontinuous posets is introduced. Some properties and characterizations of quasicontinuous posets are examined. The main results are: (1) a poset is quasicontinuous iff the lattice of all Scott open sets is a hypercontinuous lattice; (2) the directed completions of quasicontinuous posets are quasicontinuous domains; (3) A poset is continuous iff it is quasicontinuous and meet continuous, generalizing the relevant result for dcpos. Supported by the NSF of China (10371106, 10410638) and by the Fund (S0667-082) from Nanjing University of Aeronautics and Astronautics.     

Modular posets and semigroups

Posets and poset homomorphisms (preserving both order and parallelism) have been shown to form a category which is equivalent to the category of pogroupoids and their homomorphisms. Among the posets those posets whose associated pogroupoids are semigroups are identified as being precisely those posets which are (C ₂+1)-free. In the case of lattices this condition means that the lattice is alsoN ₅-free and hence modular. Using the standard connection: semigroup to poset to pogroupoid, it is observed that in many cases the image pogroupoid obtained is a semigroup even if quite different from the original one. The nature of this mapping appears intriguing in the poset setting and may well be so seen from the semigroup theory viewpoint.     

The lattice of strict completions of a finite poset

For a given finite poset , we construct strict completions of P which are models of all finite lattices L such that the set of join-irreducible elements of L is isomorphic to P. This family of lattices, , turns out to be itself a lattice, which is lower bounded and lower semimodular. We determine the join-irreducible elements of this lattice. We relate properties of the lattice to properties of our given poset P, and in particular we characterize the posets P for which . Finally we study the case where is distributive. Received October 13, 2000; accepted in final form June 13, 2001.     

交一致连续偏序集

In this paper, as a generalization of uniform continuous posets, the concept of meet uniform continuous posets via uniform Scott sets is introduced. Properties and characterizations of meet uniform continuous posets are presented. The main results are:(1) A uniform complete poset L is meet uniform continuous iff ↑(U ∩↓ x) is a uniform Scott set for each x ∈ L and each uniform Scott set U;(2) A uniform complete poset L is meet uniform continuous iff for each∨∨x∈ L and each uniform subset S, one has x ∧S ={x ∧ s | s ∈ S}. In particular, a complete lattice L is meet uniform continuous iff L is a complete Heyting algebra;(3) A uniform complete poset is meet uniform continuous iff every principal ideal is meet uniform continuous iff all closed intervals are meet uniform continuous iff all principal filters are meet uniform continuous;(4) A uniform complete poset L is meet uniform continuous if L1 obtained by adjoining a top element1 to L is a complete Heyting algebra;(5) Finite products and images of uniform continuous projections of meet uniform continuous posets are still meet uniform continuous.     

Lim-inf convergence in partially ordered sets

The lim-inf convergence in a complete lattice was introduced by Scott to characterize continuous lattices. Here we introduce and study the lim-inf convergence in a partially ordered set. The main result is that for a poset P the lim-inf convergence is topological if and only if P is a continuous poset. A weaker form of lim-inf convergence in posets is also discussed.     

L-模糊偏序集上的核算子与核系统

定义L-模糊偏序集上的L-核系统,给出了任一L-模糊偏序集上的L-核算子与L-核系统之间的一一对应关系,从而推广了有界完备L-模糊偏序集的情形,并使得模糊的情况与分明的情况更加协调。另外,也给出了L-闭包算子与L-闭包系统的相关结论。     

On Edge Decompositions of Posets

An edge decomposition of a poset P is a collection of chains such that every pair of elements of which one covers the other belongs to exactly one chain. We consider this and the related notion of the line poset L(P) which consists of pairs of adjacent elements of P so that (xy)<_L(P) (x'y') iff y _P x'. We present some min-max type results on path-cycle partitions of digraphs which are applicable to poset decompositions. Providing an explicit construction we show that the lattice of the subsets of an n-set admits an edge decomposition into symmetric chains. We demonstrate a few applications of this decomposition. Also, a characterisation of line posets is given.