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”

Moss' Logic for Ordered Coalgebras

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F22%3A00483809" target="_blank" >RIV/67985807:_____/22:00483809 - isvavai.cz</a>

  • Alternative codes found

    RIV/68407700:21230/22:00360020 RIV/00216208:11210/22:10369766

  • Result on the web

    <a href="https://dx.doi.org/10.46298/lmcs-18(3:18)2022" target="_blank" >https://dx.doi.org/10.46298/lmcs-18(3:18)2022</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.46298/lmcs-18(3:18)2022" target="_blank" >10.46298/lmcs-18(3:18)2022</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Moss' Logic for Ordered Coalgebras

  • Original language description

    We present a finitary version of Moss’ coalgebraic logic for T-coalgebras, where T is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least finitary subfunctor of the dual of the coalgebra functor T∂ω, and the semantics of the modality is given by relation lifting. For the semantics to work, T is required to preserve exact squares. For the finitary setting to work, T∂ω is required to preserve finite intersections. We develop a notion of a base for subobjects of TωX. This in particular allows us to talk about the finite poset of subformulas for a given formula. The notion of a base is introduced generally for a category equipped with a suitable factorisation system. We prove that the resulting logic has the Hennessy-Milner property for the notion of similarity based on the notion of relation lifting. We define a sequent proof system for the logic, and prove its completeness.

  • 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

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

    Logical Methods in Computer Science

  • ISSN

    1860-5974

  • e-ISSN

    1860-5974

  • Volume of the periodical

    18

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    61

  • Pages from-to

    "18:1"-"18:61"

  • UT code for WoS article

    000840685400001

  • EID of the result in the Scopus database

    2-s2.0-85135602994