1 citations · 1 across the 12 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
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…
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…
Reversible and Irreversible Trees
Miloš S. Kurilić
A tree is reversible iff there is no order such that .…
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…
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…
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…