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”

Completely separably MAD families and the modal logic of $betaomega$

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11210%2F22%3A10365335" target="_blank" >RIV/00216208:11210/22:10365335 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=d5FXEyzyTW" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=d5FXEyzyTW</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1017/jsl.2019.88" target="_blank" >10.1017/jsl.2019.88</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Completely separably MAD families and the modal logic of $betaomega$

  • Original language description

    We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of $omega$ implies that the modal logic $logic{S4.1.2}$ is complete with respect to the v{C}ech-Stone compactification of the natural numbers, the space $betaomega$. In the same fashion we prove that the modal logic $logic{S4}$ is complete with respect to the space {$omega^*=betaomegasetminusomega$}.This improves the results of G.~Bezhanishvili and J.~Harding.

  • 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

    60301 - Philosophy, History and Philosophy of science and technology

Result continuities

  • Project

    <a href="/en/project/GF17-33849L" target="_blank" >GF17-33849L: Filters, Ultrafilters and Connections with Forcing</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2022

  • 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

    Journal of Symbolic Logic

  • ISSN

    0022-4812

  • e-ISSN

  • Volume of the periodical

    87

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    10

  • Pages from-to

    498-507

  • UT code for WoS article

    000811621700004

  • EID of the result in the Scopus database

    2-s2.0-85132751991