The Upper Shift Kernel Theorems

Abstract

We now fix A ⊆ Q. We study a fundamental class of digraphs associated with A, which we call the A-digraphs. An A,kdigraph is a digraph (Ak,E), where E is an order invariant subset of A2k in the following sense. For all x,y ∈ A2k, if x,y have the same order type then x ∈ E ↔ y ∈ E.

Links

PhilArchive



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

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.

Similar books and articles

The Nature of Faith.Keith E. Yandell - 1990 - Faith and Philosophy 7 (4):451-469.
Kernel contraction.Sven Ove Hansson - 1994 - Journal of Symbolic Logic 59 (3):845-859.
General covariance from the perspective of noether's theorems.Harvey Brown & Katherine Brading - 2002 - Fenomenologia. Diálogos Possíveis Campinas: Alínea/Goiânia: Editora da Puc Goiás 79:59-86.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Jumping to a Uniform Upper Bound.Harold T. Hodes - 1982 - Proceedings of the American Mathematical Society 85 (4):600-602.
On Elements of Chance.R. Duncan Luce & A. A. J. Marley - 2000 - Theory and Decision 49 (2):97-126.
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Why axiomatic models of being conscious?Igor L. Aleksander - 2007 - Journal of Consciousness Studies 14 (7):15-27.

Analytics

Added to PP
2010-12-22

Downloads
362 (#52,437)

6 months
1 (#1,346,405)

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