We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤` β, previously denoted α ≤sw β) then β ≤T α. In fact, every random real satisfies this quasi-maximality property. As a corollary we may conclude that there exists no `-complete ∆2 real. Upon realizing that quasi-maximality does not characterize the random reals—there exist reals which are not rando...

The maximality property was introduced in [9] 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–P...

This paper proposes for safety-petri nets an algorithm for reducing on the fly a Maximality-based Labeled Transition Systems via partial order technique, in which made possible the consideration of the branches, therefore the reduction is important. The reduction graph (Maximality-based Step Graph) is a complete graph preserving the general properties (deadlock states and liveness).

Judgments about the locus of synchronic personal identity are often guided by the intuition that “I” am the thing that thinks, or minimally, that neither my body nor any part of it is a thinker distinct from me. Ted Sider argues in a series of articles that in order to reconcile this intuition with the principle of microphysical supervenience, we must accept ‘being a thinker’ as a maximal prope...

We propose to undertake a broad new collaboration in our common speciality, mathematical logic, a collaboration we hope will further enhance research in logic at CUNY. Our university is one of the few in the world which houses active researchers in so many different branches of mathematical logic, and our group alone represents already three major subfields: set theory, model theory and computa...