activity
20132026
most citedPosets of Copies of Countable Scattered Linear Orders

5 citations · 9 across the 13 of their papers we have counts for

collaborators
Showing 2013Show all

9 papers · 1 filter

math.LO2013

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…

math.LO2013

Maximal Chains of Isomorphic Subgraphs of Countable Ultrahomogeneous Graphs

Milos S. Kurilic, Borisa Kuzeljevic

For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U ø ordered…

math.LO2013

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…

math.LO2013

Four Games on Boolean Algebras

Milos S. Kurilic, Boris Sobot

The games G_2 and G_3 are played on a complete Boolean algebra B in ω-many moves. At the beginning White picks a non-zero element p of B and, in the n-th move, White picks a positi…

math.LO2013★ 1 cited

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…

math.LO2013★ 5 cited

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…

math.LO2013

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…

math.LO2013★ 1 cited

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…

math.GN2013

A convergence on Boolean algebras generalizing the convergence on the Aleksandrov cube

Miloš S. Kurilić, Aleksandar Pavlović

We compare the forcing related properties of a complete Boolean algebra B with the properties of the convergences (the algebraic convergence) and on B generalizing t…