Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMilos S. Kurilic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Milos S. Kurilic
:
Sharp Vaught's conjecture for some classes of partial orders. Ann. Pure Appl. Log. 175(4): 103411 (2024)- [j31]Milos S. Kurilic, Stevo Todorcevic:
Posets of copies of countable ultrahomogeneous tournaments. Ann. Pure Appl. Log. 175(10): 103486 (2024) - 2022
- [j30]Milos S. Kurilic, Borisa Kuzeljevic:
Antichains of copies of ultrahomogeneous structures. Arch. Math. Log. 61(5-6): 867-879 (2022) - 2021
- [j29]Milos S. Kurilic:
Vaught's Conjecture for Almost chainable Theories. J. Symb. Log. 86(3): 991-1005 (2021) - 2020
- [j28]Milos S. Kurilic, Nenad Moraca:
Reversibility of extreme relational structures. Arch. Math. Log. 59(5-6): 565-582 (2020) - [j27]Milos S. Kurilic, Stevo Todorcevic:
Posets of Copies of Countable Non-Scattered Labeled Linear Orders. Order 37(1): 59-72 (2020) - [j26]Milos S. Kurilic, Nenad Moraca:
Reversible Disjoint Unions of Well Orders and Their Inverses. Order 37(1): 73-81 (2020)
2010 – 2019
- 2019
- [j25]Milos S. Kurilic:
Vaught's conjecture for monomorphic theories. Ann. Pure Appl. Log. 170(8): 910-920 (2019) - 2017
- [j24]Milos S. Kurilic, Nenad Moraca:
Condensational equivalence, equimorphism, elementary equivalence and similar similarities. Ann. Pure Appl. Log. 168(6): 1210-1223 (2017) - [j23]Milos S. Kurilic:
Retractions of Reversible Structures. J. Symb. Log. 82(4): 1422-1437 (2017) - [j22]Milos S. Kurilic:
The Minimal Size of Infinite Maximal Antichains in Direct Products of Partial Orders. Order 34(2): 235-251 (2017) - 2016
- [j21]Milos S. Kurilic, Stevo Todorcevic:
The poset of all copies of the random graph has the 2-localization property. Ann. Pure Appl. Log. 167(8): 649-662 (2016) - 2015
- [j20]Milos S. Kurilic:
Isomorphic and strongly connected components. Arch. Math. Log. 54(1-2): 35-48 (2015) - [j19]Milos S. Kurilic:
Different similarities. Arch. Math. Log. 54(7-8): 839-859 (2015) - [j18]Milos S. Kurilic, Borisa Kuzeljevic:
Maximal Chains of Isomorphic Suborders of Countable Ultrahomogeneous Partial Orders. Order 32(1): 83-99 (2015) - 2014
- [j17]Milos S. Kurilic:
Posets of copies of countable scattered linear orders. Ann. Pure Appl. Log. 165(3): 895-912 (2014) - [j16]Milos S. Kurilic:
From A1 to D5: towards a forcing-Related Classification of Relational Structures. J. Symb. Log. 79(1): 279-295 (2014) - 2013
- [j15]Milos S. Kurilic:
Maximally embeddable components. Arch. Math. Log. 52(7-8): 793-808 (2013) - [j14]Milos S. Kurilic:
Maximal Chains of Copies of the Rational Line. Order 30(3): 737-748 (2013) - 2012
- [j13]Milos S. Kurilic, Stevo Todorcevic:
Forcing by non-scattered sets. Ann. Pure Appl. Log. 163(9): 1299-1308 (2012) - [j12]Milos S. Kurilic:
Maximal Chains in Positive Subfamilies of P(ω). Order 29(1): 119-129 (2012)
2000 – 2009
- 2009
- [j11]Milos S. Kurilic, Stevo Todorcevic:
Property (h) and cellularity of complete Boolean algebras. Arch. Math. Log. 48(8): 705-718 (2009) - [j10]Milos S. Kurilic, Boris Sobot:
A game on Boolean algebras describing the collapse of the continuum. Ann. Pure Appl. Log. 160(1): 117-126 (2009) - 2008
- [j9]Milos S. Kurilic, Boris Sobot:
Power-collapsing games. J. Symb. Log. 73(4): 1433-1457 (2008) - 2007
- [j8]Milos S. Kurilic:
Splitting families and forcing. Ann. Pure Appl. Log. 145(3): 240-251 (2007) - [j7]Milos S. Kurilic, Aleksandar Pavlovic:
A posteriori convergence in complete Boolean algebras with the sequential topology. Ann. Pure Appl. Log. 148(1-3): 49-62 (2007) - 2005
- [j6]Milos S. Kurilic:
Mad families, forcing and the Suslin Hypothesis. Arch. Math. Log. 44(4): 499-512 (2005) - 2004
- [j5]Milos S. Kurilic:
Unsupported Boolean algebras and forcing. Math. Log. Q. 50(6): 594-602 (2004) - 2003
- [j4]Milos S. Kurilic:
Changing cofinalities and collapsing cardinals in models of set theory. Ann. Pure Appl. Log. 120(1-3): 225-236 (2003) - [j3]Milos S. Kurilic:
Independence of Boolean algebras and forcing. Ann. Pure Appl. Log. 124(1-3): 179-191 (2003) - 2001
- [j2]Milos S. Kurilic:
Cohen-Stable Families of Subsets of Integers. J. Symb. Log. 66(1): 257-270 (2001)
1990 – 1999
- 1998
- [j1]Mirko Budincevic, Milos S. Kurilic:
A family of strict and discontinuous triangular norms. Fuzzy Sets Syst. 95(3): 381-384 (1998)
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-08-03 21:18 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:
