Skip to main content

and
  1. No Access

    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...

    Uri Abraham, James Cummings in Central European Journal of Mathematics (2012)

  2. No Access

    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...

    Uri Abraham, Rene Schipperus in Israel Journal of Mathematics (2007)

  3. No Access

    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 thatxC ...

    Uri Abraham, Isaac Gorelic, István Juhász in Israel Journal of Mathematics (2006)

  4. No Access

    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 \) ...

    Uri Abraham, Matatyahu Rubin, Robert Bonnet in Israel Journal of Mathematics (2001)

  5. No Access

    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

    Uri Abraham, Saharon Shelah in Archive for Mathematical Logic (1996)

  6. No Access

    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...

    Uri Abraham, Shai Ben-David, Shlomo Moran in Distributed Algorithms (1992)

  7. No Access

    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...

    Uri Abraham, Richard A. Shore in Israel Journal of Mathematics (1986)