Finite Generators for Countable Group Actions; Finite Index Pairs of Equivalence Relations; Complexity Measures for Recursive Programs

Bulletin of Symbolic Logic 24 (4):457-458 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

The complexity of countable categoricity in finite languages.Aleksander Ivanov - 2012 - Mathematical Logic Quarterly 58 (1-2):105-112.
À propos d'équations génériques.Frank O. Wagner - 1992 - Journal of Symbolic Logic 57 (2):548-554.
A propos e'equations generiques.Frank O. Wagner - 1992 - Journal of Symbolic Logic 57 (2):548-554.
On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
New spectra of strongly minimal theories in finite languages.Uri Andrews - 2011 - Annals of Pure and Applied Logic 162 (5):367-372.
Superrigidity and countable Borel equivalence relations.Simon Thomas - 2003 - Annals of Pure and Applied Logic 120 (1-3):237-262.
Diagonal Actions and Borel Equivalence Relations.Longyun Ding & Su Gao - 2006 - Journal of Symbolic Logic 71 (4):1081 - 1096.
Isols and maximal intersecting classes.Jacob C. E. Dekker - 1993 - Mathematical Logic Quarterly 39 (1):67-78.
Computational inductive definability.Dexter Kozen - 2004 - Annals of Pure and Applied Logic 126 (1-3):139-148.
Index sets in the arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.

Analytics

Added to PP
2019-01-04

Downloads
21 (#732,808)

6 months
14 (#175,908)

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