activity
20172026
most citedReversible Sequences of Cardinals, Reversible Equivalence Relations, and Similar Structures

1 citations · 1 across the 12 of their papers we have counts for

collaborators

13 papers

math.LO2026

Vaught's Conjecture for Unions of Products of Rooted Trees

Miloš S. Kurilić

Let be the class of rooted trees and its minimal closure under isomorphism, finite direct products…

math.LO2026

Vaught's Conjecture and Theories of Partial Order Admitting a Finite Lexicographic Decomposition

Miloš S. Kurilić

A complete theory of partial order is an FLD-theory iff some (equivalently, any) of its models admits a finite lexicographic decomposition ${\mathb…

math.LO2024

Weakly Boolean maximal chains of homeomorphic topologies

Miloš Kurilić, Boriša Kuzeljević

If are infinite cardinals, a linear order is isomorphic to a maximal chain in (resp. ; ) iff is weakly Boolean, the weight of all in…

math.GN2024

Closed sets in a generalization of the Alexandrov cube

Miloš S. Kurilić, Aleksandar Pavlović

We continue work on the topology obtained by the convergence , which started in \cite{KuPaCZ}, and further investigated in \cite{KuPaFil19}. The main goal is to describe th…

math.GN2024

Partial Orders of Bijectively Related or Homeomorphic Topologies

Aleksandar Janjoš, Miloš S. Kurilić

Topologies are bijectively related, in notation , if there are continuous bijections and $g: (X,…

math.GN2024

Weakly and Strongly Reversible Spaces

Miloš S. Kurilić

A topological space is reversible iff each continuous bijection (condensation) is a homeomorphism; weakly reversible iff w…

math.LO2024

Reduced Products of Collapsing Algebras

Miloš S. Kurilić

denotes the reduced power of a Boolean algebra , where is the Fréchet filter on . We investigate…

math.LO2024

Forcing With Copies of Uncountable Ordinals

Miloš S. Kurilić

For a relational structure we investigate the partial order , where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mat…

math.LO2023

Reversible and Irreversible Trees

Miloš S. Kurilić

A tree is reversible iff there is no order such that .…

math.LO2022

Connected Reduced Products

Miloš S. Kurilić

If is a binary relation on a set , the structure is connected iff the minimal equivalence relation containing is the full relation on $X…

math.GN2018

The Left, the Right and the Sequential Topology on Boolean Algebras

Miloš S. Kurilić, Aleksandar Pavlović

For the algebraic convergence , which generates the well known sequential topology on a complete Boolean algebra , we have $λ_{\mathrm{s}}=λ_{\ma…

math.LO2018

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…

math.LO2017★ 1 cited

Reversible Sequences of Cardinals, Reversible Equivalence Relations, and Similar Structures

Miloš S. Kurilić, Nenad Morača

A relational structure is said to be reversible iff every bijective endomorphism is an automorphism. We define a sequence of non-zero cardinals $\l…