16 Result(s)
within
Uri Abraham
English
-
Chapter and Conference Paper
On the Mailbox Problem
The Mailbox Problem was described and solved by Aguilera, Gafni, and Lamport in [2] with a mailbox algorithm that uses two flag registers that carry 14 values each. An interesting question that they ask is whe...
-
Chapter and Conference Paper
On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems
We propose a decidable formal theory which describes high-level properties of abstract continuous-time dynamical systems called Nondeterministic Complete Markovian Systems (NCMS). NCMS is a rather general clas...
-
Article
More results in polychromatic Ramsey theory
We study polychromatic Ramsey theory with a focus on colourings of [ω 2]2. We show that in the absence of GCH there is a wide range of possibilities. In particular each of the following is consist...
-
Chapter
Proper Forcing
The aim of this chapter is to develop the theory of proper forcings and their iteration and to provide interesting examples of its usefulness and range of applications. Our presentation is detailed and should ...
-
Chapter
Cardinal Arithmetic
Following the work of Gödel and Cohen we now know that it is impossible to determine the exact value of the continuum or of the power set of an arbitrary cardinal. Despite the limitations that the consistency ...
-
Article
Poset algebras over well quasi-ordered posets
A new class of partial order-types, class \({\mathcal{G}}^{+}_{bqo}\) is defined and investigated here. A poset P is ...
-
Article
Infinite games on finite sets
We study a family of infinite games with imperfect information introduced by B. Model for two players that alternately remove and add points to a finite set. We investigate the existence of imperfect informati...
-
Article
On Jakovlev spaces
A topological spaceX is called weakly first countable, if for every pointx there is a countable family {C n x |n ∈ω} such thatx ∈C ...
-
Article
On Poset Boolean Algebras
Let (P,≤) be a partially ordered set. The poset Boolean algebra of P, denoted F(P), is defined as follows: The set of generators of F(P) is {x p : p∈P}, and the...
-
Article
On a superatomic Boolean algebra which is not generated by a well-founded sublattice
Let b denote the unboundedness number of ωω. That is, b is the smallest cardinality of a subset \(F \subseteq \omega ^\omega \) ...
-
Article
Martin's axiom and \(\Delta^2_1\) well-ordering of the reals
Assuming an inaccessible cardinal \(\kappa\) , there is a generic extension in which \(MA + 2^{\aleph_0} = \kappa\) holds and the reals have a
-
Article
On system executions and states
An approach for modeling dynamic situations where several processes execute concurrently is described. Using the concepts “system execution” and “pomset” defined by Lamport and Gischer, we address basic issues...
-
Chapter and Conference Paper
On the limitation of the global time assumption in distributed systems
An ongoing debate among theoreticians of distributed systems concerns the global time issue. The basic question seems to be to what extent does a model with global time reflect the ‘real’ behavior of a distrib...
-
Chapter and Conference Paper
On Global-Time and Inter-process Communication
How should time be represented in models for inter-process communication? The global-time axiom implies that all events can be represented by intervals on one time-axis. Its use simplifies the analysis of prot...
-
Article
A note on Dilworth's theorem in the infinite case
If ℘ is a poset and every antichain is finite, and if the length of the well-founded poset of antichains is less than ω2 1, then ℘ is the union of countably many chains. We also compute the length of the poset of...
-
Article
Initial segments of the degrees of size ℵ1
We settle a series of questions first raised by Yates at the Jerusalem (1968) Colloquium on Mathematical Logic by characterizing the initial segments of the degrees of unsolvability of size ℵ1: Every upper semi-l...
