Many symmetrically indivisible structures release_ssatjbookvfsrotga2sngffrl4

by Nadav Meir

Released as a article .

2019  

Abstract

A structure M in a first-order language L is indivisible if for every coloring of M in two colors, there is a monochromatic M^'⊆M such that M^'M. Additionally, we say that M is symmetrically indivisible if M^' can be chosen to be symmetrically embedded in M (that is, every automorphism of M^' can be extended to an automorphism of M). In the following paper we give a general method for constructing new symmetrically indivisible structures out of existing ones. Using this method, we construct 2^ℵ_0 many non-isomorphic symmetrically indivisible countable structures in given (elementary) classes and answer negatively the following question asked by A. Hasson, M. Kojman and A. Onshuus in "On symmetric indivisibility of countable structures" (Cont. Math. 558(1):453–466): Let M be a symmetrically indivisible structure in a language L. Let L_0 ⊆L. Is ML_0 symmetrically indivisible?
In text/plain format

Archived Files and Locations

application/pdf  152.5 kB
file_nphlbptcaff25jey6fxrcg7jku
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2019-08-31
Version   v2
Language   en ?
arXiv  1411.1202v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 74a12d15-b80d-4f8c-af23-c715a5f85fca
API URL: JSON