Weakly discerning vertices in a plenitude of graphs

Dialectica (forthcoming)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,323

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

Similar books and articles

Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
Reverse mathematics and rank functions for directed graphs.Jeffry L. Hirst - 2000 - Archive for Mathematical Logic 39 (8):569-579.
Infinitary Logics and Very Sparse Random Graphs.James Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
A graph which embeds all small graphs on any large set of vertices.S. Shelah - 1988 - Annals of Pure and Applied Logic 38 (2):171-183.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Varieties of plenitude.Maegan Fairchild - 2020 - Philosophy Compass 15 (3):1–11.
Forking and Dividing in Henson Graphs.Gabriel Conant - 2017 - Notre Dame Journal of Formal Logic 58 (4):555-566.
The limits of neo‐aristotelian plenitude.Joshua Spencer - 2019 - Pacific Philosophical Quarterly 101 (1):74-92.

Analytics

Added to PP
2022-07-09

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

E. E. Sheng
University of Oxford

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references