- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The conjugacy problem for automorphism groups of countable homogeneous structures
Mathematical Logic Quarterly 62 (6):580-589 (2016)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.
The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
Conjugacy for homogeneous ordered graphs.Samuel Coskey & Paul Ellis - 2019 - Archive for Mathematical Logic 58 (3-4):457-467.
Homogeneous structures with nonuniversal automorphism groups.Wiesław Kubiś & Saharon Shelah - 2020 - Journal of Symbolic Logic 85 (2):817-827.
Recovering ordered structures from quotients of their automorphism groups.M. Giraudet & J. K. Truss - 2003 - Journal of Symbolic Logic 68 (4):1189-1198.
A Galois correspondence for countable short recursively saturated models of PA.Erez Shochat - 2010 - Mathematical Logic Quarterly 56 (3):228-238.
Decoding in the automorphism group of a recursively saturated model of arithmetic.Ermek Nurkhaidarov - 2015 - Mathematical Logic Quarterly 61 (3):179-188.
Uncountable Homogeneous Partial Orders.Manfred Droste, Dugald Macpherson & Alan Mekler - 2002 - Mathematical Logic Quarterly 48 (4):525-532.
On the topological dynamics of automorphism groups: a model-theoretic perspective.Krzysztof Krupiński & Anand Pillay - 2023 - Archive for Mathematical Logic 62 (3):505-529.
Consequences of the existence of ample generics and automorphism groups of homogeneous metric structures.Maciej Malicki - 2016 - Journal of Symbolic Logic 81 (3):876-886.
Analytics
Added to PP
2017-03-26
Downloads
41 (#662,991)
6 months
6 (#983,913)
2017-03-26
Downloads
41 (#662,991)
6 months
6 (#983,913)
Historical graph of downloads
Citations of this work
Conjugacy for homogeneous ordered graphs.Samuel Coskey & Paul Ellis - 2019 - Archive for Mathematical Logic 58 (3-4):457-467.
References found in this work
A borel reducibility theory for classes of countable structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.
Borel equivalence relations and classifications of countable models.Greg Hjorth & Alexander S. Kechris - 1996 - Annals of Pure and Applied Logic 82 (3):221-272.
The conjugacy problem for the automorphism group of the random graph.Samuel Coskey, Paul Ellis & Scott Schneider - 2011 - Archive for Mathematical Logic 50 (1-2):215-221.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-786669fdf6-5dwlc uwo