PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS
DOI10.1017/jsl.2017.74OpenAlexW2963490073MaRDI QIDQ4579799
Lovkush Agarwal, Michael Kompatscher
Publication date: 10 August 2018
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07674
typesorbitsfirst-order definabilityreductshomogeneous structurecanonical functionsHenson digraphsmaximal-closed subgroups of \(\mathrm{Sym}(\mathbb{N})\)
Interpolation, preservation, definability (03C40) Subgroups of symmetric groups (20B35) Basic properties of first-order languages and structures (03C07) Model theory of denumerable and separable structures (03C15) Infinite automorphism groups (20B27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Reducts of the random partial order
- Ramsey precompact expansions of homogeneous directed graphs
- Permutations on the random permutation
- Reducts of the generic digraph
- Ramsey classes of set systems
- Transitivity of permutation groups on unordered sets
- Reducts of random hypergraphs
- Collineation group as a subgroup of the symmetric group.
- A survey of homogeneous structures
- The affine and projective groups are maximal
- The 42 reducts of the random ordered graph
- REDUCTS OF STRUCTURES AND MAXIMAL-CLOSED PERMUTATION GROUPS
- Reducts of Ramsey structures
- The 116 reducts of (ℚ, <, a)
- Subgroups of Infinite Symmetric Groups
- Countable Ultrahomogeneous Undirected Graphs
- Reducts of the random graph
- On the Reconstruction of ℵ0 -Categorical Structures from their Automorphism Groups
- The universal homogeneous binary tree
- Decidability of Definability
- Countable homogeneous relational structures and ℵ0-categorical theories
This page was built for publication: PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS
