166 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of BelgradeRS39 papers
- Ghent UniversityBE27 papers
- Serbian Academy of Sciences and ArtsRS27 papers
- BioSense InstituteRS20 papers
- Mathematical Institute of the Serbian Academy of Sciences and Arts19 papers
- Ss. Cyril and Methodius University in SkopjeMK18 papers
- University of OxfordGB15 papers
- High Energy Accelerator Research OrganizationJP13 papers
- University of LisbonPT13 papers
- University of WarwickGB13 papers
- Centre National de la Recherche ScientifiqueFR12 papers
- Fermi National Accelerator LaboratoryUS12 papers
16 papers · 1 filter
Echeloned Spaces
Maxime Gheysens, Bojana Pavlica, Christian Pech +2
We introduce the notion of echeloned spaces - an order-theoretic abstraction of metric spaces. The first step is to characterize metrizable echeloned spaces. It turns out that morp…
Congruence of ultrafilters
Boris Šobot
We continue the research of the relation on the set of ultrafilters on , defined as an extension of the div…
Back and Forth Systems of Condensations
Miloš S. Kurilić
If is a relational language, an -structure is condensable to an -structure , we write , iff there is a…
Reconstructing the topology of the elementary self-embedding monoids of countable saturated structures
Christian Pech, Maja Pech
Every transformation monoid comes equipped with a canonical topology-the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reco…
Different Similarities
Miloš S. Kurilić
We establish the hierarchy among twelve equivalence relations (similarities) on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relati…
On automatic homeomorphicity for transformation monoids
Christian Pech, Maja Pech
Transformation monoids carry a canonical topology --- the topology of point-wise convergence. A closed transformation monoid is said to have automatic homeomorphicit…
Isomorphic and Strongly Connected Components
Milos Kurilic
We study the partial orderings of the form , where is a binary relational structure with the connectivity compone…
On polymorphism-homogeneous relational structures and their clones
Christian Pech, Maja Pech
A relational structure is homomorphism-homogeneous if every homomorphism between finite substructures extends to an endomorphism of the structure. This notion was introduced recent…
Forcing With Copies of Countable Ordinals
Milos Kurilic
Let αbe a countable ordinal and ¶(α) the collection of its subsets isomorphic to α. We show that the separative quotient of the set ¶(α) ordered by the inclusion is isomorphic to a…
Towards a Ryll-Nardzewski-type Theorem for weakly oligomorphic structures
Christian Pech, Maja Pech
A structure is called weakly oligomorphic if it realizes only finitely many n-ary positive existential types for every n. The goal of this paper is to show that the notions of homo…
Maximal Chains of Isomorphic Suborders of Countable Ultrahomogeneous Partial Orders
Milos S. Kurilic, Borisa Kuzeljevic
We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a coun…
Posets of Copies of Countable Scattered Linear Orders
Milos S. Kurilic
We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is σ-closed and atomless. So, under the CH, all the…
Maximally Embeddable Components
Milos S. Kurilic
We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures…
From A1 to D5: Towards a Forcing-Related Classification of Relational Structures
Milos S. Kurilic
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classifi…
Resource control and strong normalisation
Silvia Ghilezan, Jelena Ivetic, Pierre Lescanne +1
We introduce the \emph{resource control cube}, a system consisting of eight intuitionistic lambda calculi with either implicit or explicit control of resources and with either natu…
CD(4) has bounded width
Catarina Carvalho, Víctor Dalmau, Petar Marković +1
We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they hav…