EDBT 2026 Demo / reviewers in the wild / expert
Jirí Rosický
dblp:82/4708
· DBLP profile ↗
19ranked-venue papers
4as first author
7since 2021 · last 2026
0000-0002-9733-1222ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 18 · 4 first-author · 7 since 2021Applied, interdisciplinary, general and emerging computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Discrete Lawvere theories and monadsabstractAbstract We show that, under certain assumptions, strongly finitary enriched monads are given by discrete enriched Lawvere theories. On the other hand, monads given by discrete enriched Lawvere theories preserve surjections. Jirí Rosický |
Math. Struct. Comput. Sci. | 1 |
| 2025 | Unstable independence from the categorical point of viewabstractWe give a category-theoretic construction of simple and NSOP 1 -like independence relations in locally finitely presentable categories, and in the more general locally finitely multipresentable categories. We do so by identifying properties of a class of monomorphisms M such that the pullback squares consisting of morphisms in M form the desired independence relation. This generalizes the category-theoretic construction of stable independence relations using effective unions or cellular squares by M. Lieberman, S. Vasey and the second author to the unstable setting. Mark Kamsma, Jirí Rosický |
Ann. Pure Appl. Log. | 2 |
| 2024 | Discrete equational theoriesabstractAbstract On a locally $\lambda$ -presentable symmetric monoidal closed category $\mathcal {V}$ , $\lambda$ -ary enriched equational theories correspond to enriched monads preserving $\lambda$ -filtered colimits. We introduce discrete $\lambda$ -ary enriched equational theories where operations are induced by those having discrete arities (equations are not required to have discrete arities) and show that they correspond to enriched monads preserving preserving $\lambda$ -filtered colimits and surjections. Using it, we prove enriched Birkhof-type theorems for categories of algebras of discrete theories. This extends known results from metric spaces and posets to general symmetric monoidal closed categories. Jirí Rosický |
Math. Struct. Comput. Sci. | 1 |
| 2023 | Cellular Categories and stable IndependenceabstractAbstract We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by Baldwin–Eklof–Trlifaj are stable and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický. Michael J. Lieberman, Jirí Rosický, Sebastien Vasey |
J. Symb. Log. | 2 |
| 2022 | Induced and higher-dimensional stable independence
Michael J. Lieberman, Jirí Rosický, Sebastien Vasey |
Ann. Pure Appl. Log. | 2 |
| 2021 | Which Categories Are Varieties? ((Co)algebraic pearls)abstractCategories equivalent to single-sorted varieties of finitary algebras were characterized in the famous dissertation of Lawvere. We present a new proof of a slightly sharpened version: those are precisely the categories with kernel pairs and reflexive coequalizers having an abstractly finite, effective strong generator. A completely analogous result is proved for varieties of many-sorted algebras provided that there are only finitely many sorts. In case of infinitely many sorts a slightly weaker result is presented: instead of being abstractly finite, the generator is required to consist of finitely presentable objects. Jirí Adámek, Jirí Rosický |
CALCO | 2 |
| 2021 | Metric monadsabstractAbstract We develop universal algebra over an enriched category and relate it to finitary enriched monads over . Using it, we deduce recent results about ordered universal algebra where inequations are used instead of equations. Then we apply it to metric universal algebra where quantitative equations are used instead of equations. This contributes to understanding of finitary monads on the category of metric spaces. Jirí Rosický |
Math. Struct. Comput. Sci. | 1 |
| 2018 | Sensor based solution for cranial remodeling orthosisabstractThis article deals with measuring the procedure for the treatment of plagiocephaly of infants. Thanks to the modification of the cranial orthosis, a sensor for measuring the temperature, distance and wearing time was inserted into this orthosis. The measured data can then be sent on request via Bluetooth Low Energy to the child's parents and the attending physician. Thanks to this improvement, feedback on the course of treatment is provided enabling the treating physician to arrange a more effective course of therapy. Radek Halfar, Jan Foltyn, David Oczka, Martin Cerný 0002, Jirí Rosický, Jan Rosicky, Ales Grygar |
HealthCom | 5 |
| 2018 | Elementary equivalences and accessible functors
Tibor Beke, Jirí Rosický |
Ann. Pure Appl. Log. | 2 |
| 2017 | Metric Abstract Elementary Classes as Accessible CategoriesabstractAbstract We show that metric abstract elementary classes (mAECs) are, in the sense of [15], coherent accessible categories with directed colimits, with concrete ℵ1-directed colimits and concrete monomorphisms. More broadly, we define a notion of κ-concrete AEC—an AEC-like category in which only the κ-directed colimits need be concrete—and develop the theory of such categories, beginning with a category-theoretic analogue of Shelah’s Presentation Theorem and a proof of the existence of an Ehrenfeucht–Mostowski functor in case the category is large. For mAECs in particular, arguments refining those in [15] yield a proof that any categorical mAEC is μ-d-stable in many cardinals below the categoricity cardinal. Michael J. Lieberman, Jirí Rosický |
J. Symb. Log. | 2 |
| 2017 | Hanf numbers via accessible imagesabstractWe present several new model-theoretic applications of the fact that, under the assumption that there exists a proper class of almost strongly compact cardinals, the powerful image of any accessible functor is accessible. In particular, we generalize to the context of accessible categories the recent Hanf number computations of Baldwin and Boney, namely that in an abstract elementary class (AEC) if the joint embedding and amalgamation properties hold for models of size up to a sufficiently large cardinal, then they hold for models of arbitrary size. Moreover, we prove that, under the above-mentioned large cardinal assumption, every metric AEC is strongly d-tame, strengthening a result of Boney and Zambrano and pointing the way to further generalizations. Comment: v1: 15 pages. v2: 13 pages, reformatted with minor edits. v3: 15 pages, title changed from "Bootstrapping structural properties, via accessible images," proofs expanded, definitions clarified in response to referees' feedback. v4: 15 pages, dedication added. v5: 15 pages, minor corrections, in press Michael J. Lieberman, Jirí Rosický |
Log. Methods Comput. Sci. | 2 |
| 2016 | Classification Theory for Accessible CategoriesabstractAbstract We show that a number of results on abstract elementary classes (AECs) hold in accessible categories with concrete directed colimits. In particular, we prove a generalization of a recent result of Boney on tameness under a large cardinal assumption. We also show that such categories support a robust version of the Ehrenfeucht–Mostowski construction. This analysis has the added benefit of producing a purely language-free characterization of AECs, and highlights the precise role played by the coherence axiom. Michael J. Lieberman, Jirí Rosický |
J. Symb. Log. | 2 |
| 2012 | Abstract elementary classes and accessible categories
Tibor Beke, Jirí Rosický |
Ann. Pure Appl. Log. | 2 |
| 2007 | The Goldblatt-Thomason Theorem for Coalgebras
Alexander Kurz 0001, Jirí Rosický |
CALCO | 2 |
| 2005 | Operations and equations for coalgebrasabstractWe show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties of coalgebras by means of coequations. We argue that the resulting coequational logic generalises modal logic. This relies on the fact that coalgebraic operations respect an appropriate notion of bisimulation and can be considered as modal operators. Alexander Kurz 0001, Jirí Rosický |
Math. Struct. Comput. Sci. | 2 |
| 2002 | On abstract data types presented by multiequations
Jirí Adámek, Michel Hébert, Jirí Rosický |
Theor. Comput. Sci. | 3 |
| 1997 | Finitary SketchesabstractAbstract Finitary sketches, i.e., sketches with finite-limit and finite-colimit specifications, are proved to be as strong as geometric sketches, i.e., sketches with finite-limit and arbitrary colimit specifications. Categories sketchable by such sketches are fully characterized in the infinitary first-order logic: they are axiomatizable by σ-coherent theories, i.e., basic theories using finite conjunctions, countable disjunctions, and finite quantifications. The latter result is absolute; the equivalence of geometric and finitary sketches requires (in fact, is equivalent to) the non-existence of measurable cardinals. Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický |
J. Symb. Log. | 4 |
| 1997 | Accessible Categories, Saturation and CategoricityabstractAbstract Model-theoretic concepts of saturation and categoricity are studied in the context of accessible categories. Accessible categories which are categorical in a strong sense are related to categories of M-sets (M is a monoid). Typical examples of such categories are categories of λ-saturated objects. Jirí Rosický |
J. Symb. Log. | 1 |
| 1995 | Finitary Sketches and Finitely Accessible CategoriesabstractEvery accessible category is proved to be sketchable by a sketch with finite colimits. In contrast, a finitely accessible category is presented that cannot be sketched by a finitary sketch, i.e., a sketch with finite limits and finite colimits. Also, a category sketchable by a finitary sketch is found that is not finitely accessible. Jirí Adámek, Jirí Rosický |
Math. Struct. Comput. Sci. | 2 |