Canonical Simplification of Finite Objects, Well Quasi-Ordered by Tree Embedding
Dept. Of Computer Science, University of Illinois at Urbana-Champaign (1979)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | Lambda calculus Trees (Graph theory Directed graphs Embeddings (Mathematics | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Call number | QA9.5.I4 no. 981 | |||||||||
| ISBN(s) | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links | This entry has no external links. Add one. |
| Through your library | Configure |
Similar books and articlesOleg Belegradek, Ya'Acov Peterzil & Frank Wagner (2000). Quasi-o-Minimal Structures. Journal of Symbolic Logic 65 (3):1115-1132.
Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
James H. Schmerl (1981). Decidability and Finite Axiomatizability of Theories of ℵ0-Categorical Partially Ordered Sets. Journal of Symbolic Logic 46 (1):101 - 120.
Robert Goldblatt (2001). Quasi-Modal Equivalence of Canonical Structures. Journal of Symbolic Logic 66 (2):497-508.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Miklos Ajtai & Ronald Fagin (1990). Reachability is Harder for Directed Than for Undirected Finite Graphs. Journal of Symbolic Logic 55 (1):113-150.
Brenda J. Latka (1994). Finitely Constrained Classes of Homogeneous Directed Graphs. Journal of Symbolic Logic 59 (1):124-139.
J. C. E. Dekker (1981). Twilight Graphs. Journal of Symbolic Logic 46 (3):539-571.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
