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||categorize this paper)|
|Call number||QA9.5.I4 no. 981|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Quasi-o-Minimal Structures.Oleg Belegradek, Ya'Acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.
Why Do Mathematicians Need Different Ways of Presenting Mathematical Objects? The Case of Cayley Graphs.Irina Starikova - 2010 - Topoi 29 (1):41-51.
Isomorphisms and Nonisomorphisms of Graph Models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
Decidability and Finite Axiomatizability of Theories of ℵ0-Categorical Partially Ordered Sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
Quasi-Modal Equivalence of Canonical Structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.
Reachability is Harder for Directed Than for Undirected Finite Graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Finitely Constrained Classes of Homogeneous Directed Graphs.Brenda J. Latka - 1994 - Journal of Symbolic Logic 59 (1):124-139.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.