Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJirí Velebil
Person information
- affiliation: Czech Technical University in Prague, Department of Mathematics, Czech Republic
- affiliation (former): Technical University Braunschweig, Institute of Theoretical Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c19]Jirí Adámek, Matej Dostál, Jirí Velebil:
Strongly Finitary Monads for Varieties of Quantitative Algebras. CALCO 2023: 10:1-10:14- 2022
- [j31]Jirí Adámek, Matej Dostál
, Jirí Velebil:
A categorical view of varieties of ordered algebras. Math. Struct. Comput. Sci. 32(4): 349-373 (2022)
2010 – 2019
- 2019
- [j30]Adriana Balan, Alexander Kurz, Jirí Velebil:
Extending set functors to generalised metric spaces. Log. Methods Comput. Sci. 15(1) (2019) - 2018
- [i6]Adriana Balan, Alexander Kurz, Jirí Velebil:
Extending set functors to generalised metric spaces. CoRR abs/1809.02229 (2018) - 2017
- [j29]Adriana Balan, Alexander Kurz, Jirí Velebil:
An institutional approach to positive coalgebraic logic. J. Log. Comput. 27(6): 1799-1824 (2017) - [j28]Alexander Kurz, Jirí Velebil:
Quasivarieties and varieties of ordered algebras: regularity and exactness. Math. Struct. Comput. Sci. 27(7): 1153-1194 (2017) - 2016
- [j27]Matej Dostál, Jirí Velebil:
Morita Equivalence for Many-Sorted Enriched Theories. Appl. Categorical Struct. 24(6): 825-844 (2016) - [j26]Alexander Kurz, Jirí Velebil:
Relation lifting, a survey. J. Log. Algebraic Methods Program. 85(4): 475-499 (2016) - 2015
- [j25]Adriana Balan, Alexander Kurz, Jirí Velebil:
Positive fragments of coalgebraic logics. Log. Methods Comput. Sci. 11(3) (2015) - [j24]Jirí Adámek, Lurdes Sousa, Jirí Velebil:
Kan injectivity in order-enriched categories. Math. Struct. Comput. Sci. 25(1): 6-45 (2015) - [c18]Adriana Balan, Alexander Kurz, Jirí Velebil:
Extensions of Functors From Set to V-cat. CALCO 2015: 17-34 - 2014
- [j23]Jirí Adámek, Stefan Milius, Jirí Velebil:
Base modules for parametrized iterativity. Theor. Comput. Sci. 523: 56-85 (2014) - 2013
- [j22]Alexander Kurz, Jirí Velebil:
Enriched Logical Connections. Appl. Categorical Struct. 21(4): 349-377 (2013) - [j21]Marta Bílková, Alexander Kurz, Daniela Petrisan, Jirí Velebil:
Relation lifting, with an application to the many-valued cover modality. Log. Methods Comput. Sci. 9(4) (2013) - [j20]Jirí Adámek, Stefan Milius, Jirí Velebil:
How iterative reflections of monads are constructed. Inf. Comput. 225: 83-118 (2013) - [c17]Adriana Balan, Alexander Kurz, Jirí Velebil:
Positive Fragments of Coalgebraic Logics. CALCO 2013: 51-65 - [i5]Jirí Adámek, Lurdes Sousa, Jirí Velebil:
Kan injectivity in order-enriched categories. CoRR abs/1311.1721 (2013) - 2012
- [c16]Marta Bílková, Rostislav Horcík, Jirí Velebil:
Distributive Substructural Logics as Coalgebraic Logics over Posets. Advances in Modal Logic 2012: 119-142 - [c15]Krzysztof Kapulkin, Alexander Kurz, Jirí Velebil:
Expressiveness of Positive Coalgebraic Logic. Advances in Modal Logic 2012: 368-385 - [i4]Marta Bílková, Alexander Kurz, Daniela Petrisan, Jirí Velebil:
Relation Liftings on Preorders and Posets. CoRR abs/1210.1433 (2012) - 2011
- [j19]Jirí Adámek, Stefan Milius, Jirí Velebil:
Semantics of Higher-Order Recursion Schemes. Log. Methods Comput. Sci. 7(1) (2011) - [j18]Jirí Velebil, Alexander Kurz:
Equational presentations of functors and monads. Math. Struct. Comput. Sci. 21(2): 363-381 (2011) - [j17]Marta Bílková, Jirí Velebil, Yde Venema:
On monotone modalities and adjointness. Math. Struct. Comput. Sci. 21(2): 383-416 (2011) - [j16]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot theories: a new perspective on the equational properties of iteration. Math. Struct. Comput. Sci. 21(2): 417-480 (2011) - [j15]Panagis Karazeris, Apostolos Matzaris, Jirí Velebil:
Final coalgebras in accessible categories. Math. Struct. Comput. Sci. 21(5): 1067-1108 (2011) - [j14]Jirí Adámek, Stefan Milius, Jirí Velebil:
On second-order iterative monads. Theor. Comput. Sci. 412(38): 4969-4988 (2011) - [c14]Marta Bílková, Alexander Kurz, Daniela Petrisan, Jirí Velebil:
Relation Liftings on Preorders and Posets. CALCO 2011: 115-129 - 2010
- [j13]Jirí Adámek, Stefan Milius, Jirí Velebil:
Equational properties of iterative monads. Inf. Comput. 208(12): 1306-1348 (2010) - [j12]Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative reflections of monads. Math. Struct. Comput. Sci. 20(3): 419-452 (2010) - [c13]Jirí Adámek, Stefan Milius, Jirí Velebil:
Recursive Program Schemes and Context-Free Monads. CMCS@ETAPS 2010: 3-23 - [i3]Alexander Kurz, Daniela Petrisan, Jirí Velebil:
Algebraic Theories over Nominal Sets. CoRR abs/1006.3027 (2010)
2000 – 2009
- 2009
- [c12]Jirí Adámek, Stefan Milius, Jirí Velebil:
Semantics of Higher-Order Recursion Schemes. CALCO 2009: 49-63 - [c11]Jirí Adámek, Stefan Milius, Jirí Velebil:
A Description of Iterative Reflections of Monads (Extended Abstract). FoSSaCS 2009: 152-166 - [c10]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract). MFPS 2009: 407-427 - 2008
- [j11]Jirí Adámek, Stefan Milius, Jirí Velebil:
Bases for parametrized iterativity. Inf. Comput. 206(8): 966-1002 (2008) - 2007
- [j10]Jirí Adámek, Stefan Milius, Jirí Velebil:
Algebras with parametrized iterativity. Theor. Comput. Sci. 388(1-3): 130-151 (2007) - [c9]Jirí Adámek, Stefan Milius, Jirí Velebil:
What Are Iteration Theories? MFCS 2007: 240-252 - 2006
- [j9]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras. Log. Methods Comput. Sci. 2(5) (2006) - [j8]Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative algebras at work. Math. Struct. Comput. Sci. 16(6): 1085-1131 (2006) - [c8]Jirí Adámek, Stefan Milius, Jirí Velebil:
How Iterative are Iterative Algebras? CMCS 2006: 157-175 - [i2]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras. CoRR abs/cs/0609040 (2006) - 2005
- [j7]Jirí Adámek, Stefan Milius, Jirí Velebil:
A general final coalgebra theorem. Math. Struct. Comput. Sci. 15(3): 409-432 (2005) - [c7]Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras: (Extended Abstract). MFPS 2005: 87-109 - 2004
- [j6]Jirí Adámek, Stefan Milius, Jirí Velebil:
On coalgebra based on classes. Theor. Comput. Sci. 316(1): 3-23 (2004) - [c6]Jirí Adámek, Stefan Milius, Jirí Velebil:
From Iterative Algebras to Iterative Theories (Extended Abstract). CMCS 2004: 3-24 - [c5]Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative Algebras for a Base. CTCS 2004: 147-170 - 2003
- [j5]Jirí Adámek, Stefan Milius, Jirí Velebil:
Some Remarks on Finitary and Iterative Monads. Appl. Categorical Struct. 11(6): 521-541 (2003) - [j4]Jirí Adámek, Stefan Milius, Jirí Velebil:
Free Iterative Theories: A Coalgebraic View. Math. Struct. Comput. Sci. 13(2): 259-320 (2003) - [j3]Peter Aczel, Jirí Adámek, Stefan Milius, Jirí Velebil:
Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. 300(1-3): 1-45 (2003) - [i1]Jirí Adámek, Stefan Milius, Jirí Velebil:
On coalgebra based on classes. CoRR cs.LO/0306118 (2003) - 2002
- [c4]Jirí Adámek, Stefan Milius, Jirí Velebil:
Parametric corecursion and completely iterative monads. FICS 2002: 2-5 - [c3]Jirí Adámek, Stefan Milius, Jirí Velebil:
Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. CMCS 2002: 1-28 - [c2]Jirí Adámek, Stefan Milius, Jirí Velebil:
On Rational Monads and Free Iterative Theories. CTCS 2002: 23-46 - 2001
- [c1]Peter Aczel, Jirí Adámek, Jirí Velebil:
A Coalgebraic View of Infinite Trees and Iteration. CMCS 2001: 1-26
1990 – 1999
- 1999
- [j2]Jirí Velebil:
Categorical Generalization of a Universal Domain. Appl. Categorical Struct. 7(1-2): 209-226 (1999) - [j1]Vera Trnková, Jirí Velebil:
On categories generalizing universal domains. Math. Struct. Comput. Sci. 9(2): 159-175 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
