Miloš S. Kurilić

activity

20172019

collaborators

6 papers

math.LO2019

Vaught's Conjecture for Almost Chainable Theories

Miloš S. Kurilić

A structure $Y$ of a relational language $L$ is called almost chainable iff there are a finite set $F \subset Y$ and a linear order $<$ on the set $Y ∖ F$ such tha…

math.LO2019

Antichains of Copies of Ultrahomogeneous Structures

Miloš S. Kurilić, Boriša Kuzeljević

We investigate possible cardinalities of maximal antichains in the poset of copies $⟨ P (X), \subset ⟩$ of a countable ultrahomogeneous relational structu…

math.LO2018

Vaught's Conjecture for Monomorphic Theories

Miloš S. Kurilić

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$ -element substructures isomorphic, for each p…

math.LO2018

Reversibility of Extreme Relational Structures

Miloš S. Kurilić, Nenad Morača

A relational structure $X$ is called reversible iff each bijective homomorphism from $X$ onto $X$ is an isomorphism, and linear orders are prototypical e…

math.LO2017

Reversible Disjoint Unions of Well Orders and Their Inverses

Miloš S. Kurilić, Nenad Morača

A poset $P$ is called reversible iff every bijective homomorphism $f : P \to P$ is an automorphism. Let $W$ and ${\mathcal{W}} ^*…

math.LO2017

Reversibility of Disconnected Structures

Miloš S. Kurilić, Nenad Morača

A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disc…