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.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets.James H. Schmerl - 1981 - Journal of Symbolic Logic 46 (1):101 - 120.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Correlations entre complexification et instabilite dans une formalisation du concept de complexite.F. Collot - 1995 - Acta Biotheoretica 43 (1-2):195-204.
P 1 INCOMPLETENESS: finite set equations.Harvey M. Friedman - unknown
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
The incompleteness of theories of games.Marcelo Tsuji, Newton C. A. Costa & Francisco A. Doria - 1998 - Journal of Philosophical Logic 27 (6):553-568.
Search for consequences.Harvey Friedman - manuscript
On best transitive approximations to simple graphs.Leon Horsten - unknown
P01 INCOMPLETENESS: finite set equations.Harvey M. Friedman - unknown
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.

Analytics

Added to PP
2009-01-28

Downloads
189 (#101,511)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references