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”

Algebraic Reasoning over Relational Structures

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F24%3A00139638" target="_blank" >RIV/00216224:14310/24:00139638 - isvavai.cz</a>

  • Result on the web

    <a href="https://entics.episciences.org/14598" target="_blank" >https://entics.episciences.org/14598</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.46298/entics.14598" target="_blank" >10.46298/entics.14598</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Algebraic Reasoning over Relational Structures

  • Original language description

    Many important computational structures involve an intricate interplay between algebraic features (given by operations on the underlying set) and relational features (taking account of notions such as order or distance). This paper investigates algebras over relational structures axiomatized by an infinitary Horn theory, which subsume, for example, partial algebras, various incarnations of ordered algebras, quantitative algebras introduced by Mardare, Panangaden, and Plotkin, and their recent extension to generalized metric spaces and lifted algebraic signatures by Mio, Sarkis, and Vignudelli. To this end, we develop the notion of clustered equation, which is inspired by Mardare et al.'s basic conditional equations in the theory of quantitative algebras, at the level of generality of arbitrary relational structures, and we prove that it is equivalent to an abstract categorical form of equation earlier introduced by Milius and Urbat. Our main results are a family of Birkhoff-type variety theorems (classifying the expressive power of clustered equations) and an exactness theorem (classifying abstract equations by a congruence property).

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10100 - Mathematics

Result continuities

  • Project

    <a href="/en/project/GA22-02964S" target="_blank" >GA22-02964S: Enriched categories and their applications</a><br>

  • Continuities

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

Others

  • Publication year

    2024

  • 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

  • Article name in the collection

    Proceedings of the Fortieth Conference on the Mathematical Foundations of Programming Semantics, Volume 4

  • ISBN

  • ISSN

    2969-2431

  • e-ISSN

    2969-2431

  • Number of pages

    20

  • Pages from-to

    „13-1“-„13-20“

  • Publisher name

    Inria

  • Place of publication

    France

  • Event location

    Oxford

  • Event date

    Jun 19, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article