Homogenizable structures and model completeness

DOI10.1007/S00153-016-0507-6MaRDI QIDQ334999zbMATH OpenOpenAlexWikidataFDO

Authors Ove Ahlman

Publication date 1 November 2016

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1601.07304

zbMATH Keywords

amalgamation classhomogenizabilitymodel completenessquantifier elimination

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Model theory of denumerable and separable structures (03C15) Other model constructions (03C30) Models with special properties (saturated, rigid, etc.) (03C50) Properties of classes of models (03C52)

Abstract: A homogenizable structure $mathcalM$ is a structure where we may add a finite amount of new relational symbols to represent some $emptyset-$definable relations in order to make the structure homogeneous. In this article we will divide the homogenizable structures into different classes which categorize many known examples and show what makes each class important. We will show that model completeness is vital for the relation between a structure and the amalgamation bases of its age and give a necessary and sufficient condition for an $omega-$categorical model-complete structure to be homogenizable.

Review text

A structure \(\mathcal{M}\) is called homogenizable if it is homogeneous after adding a finite number of new relations which are 0-definable. Here, the author divides the homogenizable structures into several classes and investigates the properties of the structures in these classes. He considers known examples with respect to his classes. A homogenizable structure \(\mathcal{M}\) is boundedly homogenizable if for each \(\bar{a} \in M\) there exists a \(\bar{b} \in M\) such that tp\((\bar{a}\bar{b})\) is isolated by a quantifier free formula, and \(\mathcal{M}\) is uniformly homogenizable if there is a tuple \(\bar{a}\in M\) such that for any \(\bar{b} \in M\), tp\((\bar{a}\bar{b})\) is isolated by a quantifier-free formula. The author shows that model completeness is important when studying homogenizability. He gives a necessary and sufficient condition for \(\aleph_0\)-categorical model-complete structures to be homogenizable. He shows: If \(\mathbf{K}\) is a class of structures closed under isomorphism and satisfying HP and AP, then the Fraïssé limit of \(\mathbf{K}\) is the unique boundedly homogeneous structure with age \(\mathbf{K}\).

Recommendations

• scientific article; zbMATH DE number 4108740
• Homogeneous models and generic extensions
• Homogeneous models and generic extensions
• Homogeneous and strictly homogeneous criteria for partial structures
• scientific article; zbMATH DE number 4091477
• On hyperhomogeneous and absolutely homogeneous models
• scientific article; zbMATH DE number 4127183
• Computability of homogeneous models
• scientific article; zbMATH DE number 4016877
• Indiscernible sets in homogeneous models

Cites work

• \(>k\)-homogeneous infinite graphs
• A course in model theory
• A survey of homogeneous structures
• A Universal Structure for N -Free Graphs
• Complexities of Relational Structures
• Homogenizable relational structures
• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 3080680 (Why is no real title available?)
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• Limit laws and automorphism groups of random nonrigid structures
• Model Companions for ℵ 0 -Categorical Theories
• On the relational complexity of a finite permutation group
• The universal homogeneous binary tree

Cited in

(11)

• Homogeneous and strictly homogeneous criteria for partial structures
• \(>k\)-homogeneous infinite graphs
• Remarks on weak amalgamation and large conjugacy classes in non-Archimedean groups
• A viewpoint on amalgamation classes.
• Potential isomorphism of elementary substructures of a strictly stable homogeneous model
• Non-homogenizable classes of finite structures
• Structures, homomorphisms, and the needs of model theory
• Examples of weak amalgamation classes
• Solving infinite-domain CSPs using the patchwork property
• Homogeneity and homogenizability: hard problems for the logic SNP
• Homogenizable relational structures

This page was built for publication: Homogenizable structures and model completeness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334999)