Isomorphic and strongly connected components
暂无分享,去创建一个
[1] Milos S. Kurilic. From A1 to D5: towards a forcing-Related Classification of Relational Structures , 2014, J. Symb. Log..
[2] R. Woodrow,et al. Countable ultrahomogeneous undirected graphs , 1980 .
[4] Milos S. Kurilic. Posets of copies of countable scattered linear orders , 2014, Ann. Pure Appl. Log..
[5] The distributivity numbers of finite products of P(ω)/fin , 1998 .
[6] Gregory L. Cherlin. Homogeneous directed graphs. The imprimitive case , 1985, Logic Colloquium.
[7] A. H. Lachlan,et al. Countable homogeneous tournaments , 1984 .
[8] Gregory Cherlin. Homogeneous Directed Graphs , 1993 .
[9] Stevo Todorcevic,et al. Forcing by non-scattered sets , 2012, Ann. Pure Appl. Log..
[10] James H. Schmerl,et al. Countable homogeneous partially ordered sets , 1979 .
[11] G. Cherlin,et al. The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous N-Tournaments , 1998 .
[12] Milos S. Kurilic. Maximally embeddable components , 2013, Arch. Math. Log..
[13] Dugald Macpherson,et al. A survey of homogeneous structures , 2011, Discret. Math..
[14] Forcing with copies of countable ordinals , 2013, 1304.7714.