All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

On countably saturated linear orders and certain class of countably saturated graphs

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F21%3A00537538" target="_blank" >RIV/67985840:_____/21:00537538 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1007/s00153-020-00742-7" target="_blank" >https://doi.org/10.1007/s00153-020-00742-7</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s00153-020-00742-7" target="_blank" >10.1007/s00153-020-00742-7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    On countably saturated linear orders and certain class of countably saturated graphs

  • Original language description

    The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality c. We provide some examples of pairwise non-isomorphic countably saturated linear orders of cardinality c, under different set-theoretic assumptions. We give a new proof of the old theorem of Harzheim, that the class of countably saturated linear orders has a uniquely determined one-element basis. From our proof it follows that this minimal linear order is a Fraïssé limit of certain Fraïssé class. In particular, it is homogeneous with respect to countable subsets. Next we prove the existence and uniqueness of the uncountable version of the random graph. This graph is isomorphic to (H(ω1) , ∈ ∪ ∋) , where H(ω1) is the set of hereditarily countable sets, and two sets are connected if one of them is an element of the other. In the last section, an example of a prime countably saturated Boolean algebra is presented.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

    <a href="/en/project/GF16-34860L" target="_blank" >GF16-34860L: Logic and Topology in Banach spaces</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Archive for Mathematical Logic

  • ISSN

    0933-5846

  • e-ISSN

    1432-0665

  • Volume of the periodical

    60

  • Issue of the periodical within the volume

    1-2

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    21

  • Pages from-to

    189-209

  • UT code for WoS article

    000545545900001

  • EID of the result in the Scopus database

    2-s2.0-85087498461