Structure and enumeration theorems for hereditary properties in finite relational languages

Annals of Pure and Applied Logic 169 (5):413-449 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,518

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On non-abelian C-minimal groups.Patrick Simonetta - 2003 - Annals of Pure and Applied Logic 122 (1-3):263-287.
Reverse mathematics and properties of finite character.Damir D. Dzhafarov & Carl Mummert - 2012 - Annals of Pure and Applied Logic 163 (9):1243-1251.
Back and forth relations for reduced abelian p-groups.Ewan J. Barker - 1995 - Annals of Pure and Applied Logic 75 (3):223-249.
Empty intervals in the enumeration degrees.Thomas F. Kent, Andrew Em Lewis & Andrea Sorbi - 2012 - Annals of Pure and Applied Logic 163 (5):567-574.
On restricted forms of enumeration reducibility.Phil Watson - 1990 - Annals of Pure and Applied Logic 49 (1):75-96.
The automorphism group of the enumeration degrees.Mariya I. Soskova - 2016 - Annals of Pure and Applied Logic 167 (10):982-999.

Analytics

Added to PP
2018-01-11

Downloads
19 (#1,086,124)

6 months
6 (#891,985)

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

Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.

Add more references