Measuring complexities of classes of structures

Annals of Pure and Applied Logic 166 (12):1365-1381 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Ramsey classes of topological and metric spaces.Jaroslav Nešetřil - 2006 - Annals of Pure and Applied Logic 143 (1-3):147-154.
Index sets for some classes of structures.Ekaterina B. Fokina - 2009 - Annals of Pure and Applied Logic 157 (2-3):139-147.
On complexity of Ehrenfeucht–Fraïssé games.Bakhadyr Khoussainov & Jiamou Liu - 2010 - Annals of Pure and Applied Logic 161 (3):404-415.
Smooth classes without AC and Robinson theories.Massoud Pourmahdian - 2002 - Journal of Symbolic Logic 67 (4):1274-1294.

Analytics

Added to PP
2015-08-28

Downloads
22 (#710,690)

6 months
1 (#1,474,534)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
Degrees coded in jumps of orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Degrees of structures.Linda Jean Richter - 1981 - Journal of Symbolic Logic 46 (4):723-731.

View all 12 references / Add more references