Publications of Jiri Velebil

Preprints:

Accepted papers:

    Published papers:

    1. J. Adámek, M. Dostál, J. Velebil: Strongly finitary monads and continuous algebras ,10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023), 10:1--10:14.

       

    2. J. Adámek, M. Dostál, J. Velebil: A categorical view of varieties of ordered algebras,Math. Structures Comput. Sci. 32.4 (2022), 349--373

       

    3. A. Balan, A. Kurz, J. Velebil: Extending set functors to generalised metric spaces,Log. Methods Comput. Sci.15(1:5) (2019), 1--57

       

    4. A. Kurz, J. Velebil: Quasivarieties and varieties of ordered algebras: regularity and exactness, Math. Structures Comput. Sci., 27 (2017), 1153--1194

       

    5. A. Balan, A. Kurz, J. Velebil: An institutional approach to positive coalgebraic logics, J. Logic Comput., Vol. 27, 6.1 (2017), 1799--1824

       

    6. J. Adámek, S. Milius, J. Velebil: A presentation of bases for parametrized iterativity, Theory Appl. Categ., Vol. 32 (2017), 682--718

       

    7. M. Dostál, J. Velebil: Morita equivalence for many-sorted enriched theories, Appl. Categ. Structures, 24.6 (2016), 825--844

       

    8. A. Kurz, J. Velebil: Relation lifting, a survey, Journal of Logical and Algebraic Methods in Programming 85.4 (2016), 475--499

       

    9. A. Balan, A. Kurz, J. Velebil: Positive fragments of coalgebraic logics, Log. Methods Comput. Sci. 11(3:18) (2015), 1--51

       

    10. A. Balan, A. Kurz, J. Velebil: Extensions of functors from Set to V-cat, Proceedings of CALCO 2015 (Larry Moss and Paweł Sobocinski, eds.), Leibniz International Proceedings in Informatics, 17--34

       

    11. J. Adámek, L. Sousa, J. Velebil: Kan injectivity in order-enriched categories, Math. Structures Comput. Sci. 25.1 (2015), 6--45

       

    12. J. Adámek, S. Milius, J. Velebil: Base modules for parametrized iterativity, Theoret. Comput. Sci. 523 (2014), 56--85

       

    13. M. Bílková, A. Kurz, D. Petrişan, J. Velebil: Relation lifting, with an application to the many-valued cover modality, Log. Methods Comput. Sci. 9(4:8) 2013, 1--48

       

    14. A. Balan, A. Kurz, J. Velebil: Positive fragments of coalgebraic modal logics, in: Proceedings of CALCO 2013, LNCS 8089 (R. Heckel, S. Milius, eds.), Springer, 51--65

       

    15. A. Kurz, J. Velebil: Enriched logical connections, Appl. Categ. Structures 21.4 (2013), 349--377

       

    16. J. Adámek, S. Milius, J. Velebil: How iterative reflections of monads are constructed, Inform. and Comput. 225 (2013), 83--118

       

    17. A. Kurz, J. Velebil: Regularity and exactness of quasivarieties and varieties of ordered algebras, in Coalgebraic Logics (Dagstuhl Seminar 12411), Dagstuhl Reports 2.10 (2013), 57--58

       

    18. K. Kapulkin, A. Kurz, J. Velebil: Expressiveness of positive coalgebraic logic, Advances in Modal Logic 2012, 368--385

       

    19. M. Bílková, R. Horčík, J. Velebil: Distributive substructural logics as coalgebraic logics over posets, Advances in Modal Logic 2012, 119--142 (the full version with all the proofs is available here )

       

    20. A. Balan, A. Kurz, J. Velebil: On coalgebraic logic over posets, Short Contributions of 11th International Workshop CMCS 2012, (L. Schröder, D. Pattison, eds.), Inst. Cybern., Technical University Tallin, 6--7

       

    21. M. Bílková, A. Kurz, D. Petrişan, J. Velebil: Relation liftings on preorders, in: Proceedings of CALCO 2011, LNCS 6859 (A. Corradini, B. Klin, C. Cirstea, eds.), Springer, 115--129 (a slightly expanded version is available at the arXiv )

       

    22. P. Karazeris, A. Matzaris, J. Velebil: Final coalgebras in accessible categories, Math. Structures Comput. Sci. 21 (2011), 1067--1108

       

    23. J. Adámek, S. Milius, J. Velebil: On second-order iterative monads, Theoret. Comput. Sci. 412 (2011), 4969--4988

       

    24. J. Adámek, S. Milius, J. Velebil: Semantics of higher-order recursion schemes, Log. Methods Comput. Sci. Vol. 7 (2011), 1--43

       

    25. J. Velebil, A. Kurz: Equational presentations of functors and monads, Math. Structures Comput. Sci. 21 (2011), 363--381

       

    26. J. Adámek, S. Milius, J. Velebil: Elgot theories: A new perspective on the equational properties of iteration, Math. Structures Comput. Sci. 21 (2011), 417--480

       

    27. M. Bílková, J. Velebil, Y. Venema: On monotone modalities and adjointness, Math. Structures Comput. Sci. 21 (2011), 383--416

       

    28. J. Adámek, S. Milius, J. Velebil: Equational Properties of Iterative Monads , Inform. and Comput. 208 (2010), 1306--1348

       

    29. J. Adámek, S. Milius, J. Velebil: Recursive Program Schemes and Context-Free Monads , Proceedings CMCS 2010, Electron. Notes Theor. Comput. Sci. 264 (2010), 3--23

       

    30. K. Kapulkin, A. Kurz, J. Velebil: Expressivity of coalgebraic logic over posets, In: CWI Research Report SEN-1004 (B.P.F. Jacobs, M. Niqui, J.J.M.M. Rutten, A. Silva, eds.), 2010, 16--17

       

    31. J. Adámek, S. Milius, J. Velebil: Iterative Reflections of Monads , Math. Structures Comput. Sci., 20.3 (2010), 419--452

       

    32. J. Adámek, S. Milius, J. Velebil: Semantics of higher-order recursion schemes , Proceedings of CALCO 2009, LNCS 5728 (A. Kurz, M. Lenisa, and A. Tarlecki, eds.), Springer, 49--63

       

    33. J. Adámek, S. Milius, J. Velebil: Elgot Theories: A new Perspective of Iteration Theories , Electron. Notes Theor. Comput. Sci., 249 (2009), 407--427

       

    34. P. Karazeris, J. Velebil: Representability Relative to a Doctrine, Cah. Topol. Géom. Différ. Catég. L-1 (2009), 3--22

       

    35. J. Adámek, S. Milius, J. Velebil: A Description of Iterative Reflections of Monads, Proceedings of FoSSaCS 2009 (L. de Alfaro, ed.), LNCS 5504, Springer, 152--166

       

    36. J. Adámek, J. Velebil: Analytic Functors and Weak Pullbacks, Theory Appl. Categ. Vol. 21 (2008), 191--209

       

    37. J. Adámek, S. Milius, J. Velebil: Bases for Parametrized Iterativity, Inform. and Comput., 206.8 (2008), 966--1002

       

    38. J. Adámek, R. Börger, S. Milius, J. Velebil: Iterative Algebras: How Iterative Are They?, Theory Appl. Categ., Vol. 19 (2008), 61--92

       

    39. J. Adámek, S. Milius, J. Velebil: Algebras with Parametrized Iterativity, Theoret. Comput. Sci. 388 (2007), 130--151

       

    40. J. Adámek, S. Milius, J. Velebil: What are Iteration Theories?, Proceedings of MFCS 2007 (L. Kučera and A. Kučera, eds.), LNCS 4708, Springer, 240--252

       

    41. P. Karazeris, J. Velebil: Dense Morphisms of Monads , Theory Appl. Categ., Vol. 18 (2007), 372-399

       

    42. J. Adámek, S. Milius, J. Velebil: Iterative Algebras at Work, Math. Structures Comput. Sci., 16.6 (2006), 1085--1131

       

    43. J. Adámek, S. Milius, J. Velebil: Elgot Algebras, Log. Methods Comput. Sci., Vol. 2(5:4) (2006), 1--31

       

    44. J. Adámek, S. Milius, J. Velebil: How Iterative are Iterative Algebras?, Electron. Notes Theor. Comput. Sci., 164.1 (2006), 157--175

       

    45. J. Adámek, S. Milius, J. Velebil: Elgot Algebras (Extended Abstract), Electron. Notes Theor. Comput. Sci., 155 (2006), 87--109

       

    46. J. Adámek, S. Milius, J. Velebil: A General Final Coalgebra Theorem, Math. Structures Comput. Sci., 15.3 (2005), 409--432

       

    47. J. Adámek, S. Milius, J. Velebil: Iterative Algebras for a Base, Electron. Notes Theor. Comput. Sci., 122 (2005), 147--170

       

    48. P. Karazeris, J. Rosický, J. Velebil: Completeness of Cocompletions, J. Pure Appl. Algebra, 196 (2005), 229--250

       

    49. J. Adámek, S. Milius, J. Velebil: From Iterative Algebras to Iterative Theories (Extended Abstract), Electron. Notes Theor. Comput. Sci., 106 (2004), 3--24

       

    50. J. Adámek, S. Milius, J. Velebil: On Coalgebra Based on Classes, Theoret. Comput. Sci., 316 (2004), 3--23

       

    51. J. Adámek, S. Milius, J. Velebil: Some Remarks on Finitary and Iterative Monads, Appl. Categ. Structures, 11 (2003), 521--541

       

    52. P. Aczel, J. Adámek, S. Milius, J. Velebil: Infinite Trees and Completely Iterative Theories --- A Coalgebraic View, (A Fundamental Study), Theoret. Comput. Sci, 300 (2003), 1--45

       

    53. J. Adámek, S. Milius, J. Velebil: Free Iterative Theories --- A Coalgebraic View, Math. Structures Comput. Sci., 13 (2003), 259--320

       

    54. J. Adámek, S. Milius, J. Velebil: On Rational Monads and Free Iterative Theories, Electron. Notes Theor. Comput. Sci. 69 (2003)

       

    55. R. El Bashir, J. Velebil: Simultaneously Reflective and Coreflective Subcategories of Presheaves, Theory Appl. Categ. Vol.10 (2002), 410--423

       

    56. J. Adámek, S. Milius, J. Velebil: Final Coalgebras and a Solution Theorem for Arbitrary Endofunctors, Electron. Notes Theor. Comput. Sci. 65.1 (2002)

       

    57. J. Velebil, J. Adámek: A Remark on Conservative Cocompletions of Categories, J. Pure Appl. Algebra 168 (2002), 107--124

       

    58. J. Adámek, R. El Bashir, M. Sobral, J. Velebil: On Functors Which Are Lax Epimorphisms, Theory Appl. Categ. Vol.8 (2001), 509--521

       

    59. P. Aczel, J. Adámek, J. Velebil: A Coalgebraic View of Infinite Trees and Iteration, Electron. Notes Theor. Comput. Sci. 44.1 (2001)

       

    60. J. Adámek, V. Koubek, J. Velebil: A Duality Between Infinitary Varieties and Algebraic Theories, Comment. Math. Univ. Carolin. 41,3 (2000), 529--541

       

    61. V. Trnková, J. Velebil: On Categories Generalizing Universal Domains, Math. Structures Comput. Sci. (1999), vol. 9, 159--175

       

    62. J. Velebil: Categorical Generalization of a Universal Domain, Appl. Categ. Structures 7 (1999), 209--226

       

    63. K. Richta, J. Velebil: Sémantika programovacích jazyků, lecture notes (in Czech), 169pp., Karolinum Publishing House, Praha 1996

       

    PhD Thesis: