Computable polish group actions

&
Journal of Symbolic Logic 83 (2):443-460 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2017.68

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,951

External links

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

Through your library

My notes

Similar books and articles

Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Alexander G. Melnikov - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Reviewed Work(s): A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 by Uri Andrews; A computable N₀-categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 by Bakhadyr Khoussainov; Antonio Montalbán. [REVIEW]Review by: Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401,.
Uri Andrews. A new spectrum of recursive models using an amalgamation construction. The Journal of Symbolic Logic, vol. 73 (2011), no. 3, pp. 883–896. - Bakhadyr Khoussainov and Antonio Montalbán. A computable ℵ 0 -categorical structure whose theory computes true arithmetic. The Journal of Symbolic Logic, vol. 72 (2010), no. 2, pp. 728–740. [REVIEW]Alexander G. Melnikov - 2013 - Bulletin of Symbolic Logic 19 (3):400-401.
Howard Becker and Alexander S. Kechris. The descriptive set theory of Polish group actions. London Mathematical Society lecture note series, no. 232. Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, xi + 136 pp. [REVIEW]Arlan Ramsay - 1998 - Journal of Symbolic Logic 63 (4):1604-1605.
Interpreting a Field in its Heisenberg Group.Rachael Alvir, Wesley Calvert, Grant Goodman, Valentina Harizanov, Julia Knight, Russell Miller, Andrey Morozov, Alexandra Soskova & Rose Weisshaar - 2022 - Journal of Symbolic Logic 87 (3):1215-1230.
Computable Topological Groups.K. O. H. Heer Tern, Alexander G. Melnikov & N. G. Keng Meng - 2025 - Journal of Symbolic Logic 90 (1):188-220.
Greg Hjorth and Alexander S. Kechris. Analytic equivalence relations and Ulm-type classifications. The journal of symbolic logic, vol. 60 , pp. 1273–1300. - Greg Hjorth, Alexander S. Kechris, and Alain Louveau. Borel equivalence relations induced by actions of the symmetric group. Annals of pure and applied logic, vol. 92 , pp. 63–112. [REVIEW]Sławomir Solecki - 2001 - Bulletin of Symbolic Logic 7 (4):541-544.
Computability of polish spaces up to homeomorphism.Matthew Harrison-Trainor, Alexander Melnikov & Keng Meng Ng - 2020 - Journal of Symbolic Logic 85 (4):1664-1686.
Degree Spectra of Homeomorphism Type of Compact Polish Spaces.Mathieu Hoyrup, Takayuki Kihara & Victor Selivanov - forthcoming - Journal of Symbolic Logic:1-32.
Antonio Montalbán, Indecomposable linear orderings and hyperarithmetic analysis. Journal of Mathematical Logic, vol. 6 (2006), no. 1, pp. 89–120. - Itay Neeman, The strength of Jullien’s indecomposability theorem. Journal of Mathematical Logic, vol. 8 (2008), no. 1, pp. 93–119. - Itay Neeman, Necessary use of induction in a reversal. Journal of Symbolic Logic, vol. 76 (2011), no. 2, pp. 561–574. [REVIEW]Henry Towsner - 2014 - Bulletin of Symbolic Logic 20 (3):366-368.

Analytics

Added to PP
2018-08-02

Downloads
28 (#898,774)

6 months
5 (#876,395)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computable Stone spaces.Nikolay Bazhenov, Matthew Harrison-Trainor & Alexander Melnikov - 2023 - Annals of Pure and Applied Logic 174 (9):103304.
Computable Topological Groups.K. O. H. Heer Tern, Alexander G. Melnikov & N. G. Keng Meng - 2025 - Journal of Symbolic Logic 90 (1):188-220.

Add more citations

References found in this work

Add more references