P01 INCOMPLETENESS: Finite graph theory
| Abstract | For digraphs G, we write V(G) for the set of all vertices of G, and E(G) for the set of all edges of G. A digraph on a set E is a digraph G where V(G) = E. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
  Try with proxy. Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesJames H. Schmerl (1981). Decidability and Finite Axiomatizability of Theories of ℵ0-Categorical Partially Ordered Sets. Journal of Symbolic Logic 46 (1):101 - 120.
Marcelo Tsuji, Newton C. A. Costdaa & Francisco A. Doria (1998). The Incompleteness of Theories of Games. Journal of Philosophical Logic 27 (6):553-568.
Harold Schellinx (1991). Isomorphisms and Nonisomorphisms of Graph Models. Journal of Symbolic Logic 56 (1):227-249.
F. Collot (1995). Correlations Entre Complexification Et Instabilite Dans Une Formalisation du Concept de Complexite. Acta Biotheoretica 43 (1-2).
J. C. E. Dekker (1981). Twilight Graphs. Journal of Symbolic Logic 46 (3):539-571.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads5 ( #161,910 of 556,788 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
