Computable axiomatizability of elementary classes

DOI10.1002/MALQ.201400110MaRDI QIDQ2793906zbMATH OpenOpenAlexFDO

Authors Peter Sinclair

Publication date 17 March 2016

Published in Mathematical Logic Quarterly (MLQ) (Search for Journal in Brave)

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

zbMATH Keywords

C-minimalityelementary classeso-minimalityP-minimalitypseudo-o-minimality

Mathematics Subject Classification ID

Ultraproducts and related constructions (03C20) Properties of classes of models (03C52) Models of arithmetic and set theory (03C62) Model theory of ordered structures; o-minimality (03C64) Model theory of fields (12L12)

Abstract: The goal of this paper is to generalise Alex Rennet's proof of the non-axiomatizability of the class of pseudo-o-minimal structures. Rennet showed that if L is an expansion of the language of ordered fields and K is the class of pseudo-o-minimal L-structures (L-structures elementarily equivalent to an ultraproduct of o-minimal structures) then K is not computably axiomatizable. We give a general version of this theorem, and apply it to several classes of topological structures.

Review text

An elementary class is \textit{computably axiomatizable} if there is a computable axiomatization of its theory. A structure is \textit{pseudo-o-minimal} if it is elementarily equivalent to an ultraproduct of o-minimal structures. \textit{A. Rennet} proved in [J. Symb. Log. 79, No. 1, 54--59 (2014; Zbl 1338.03071)] that the class of pseudo-o-minimal structures is not computably axiomatizable. Sinclair adopts Rennet's argument to prove a general theorem with several applications to other classes, in particular to C-minimal structures defined in [\textit{D. Haskell} and \textit{D. Macpherson}, Ann. Pure Appl. Logic 66, No. 2, 113--162 (1994; Zbl 0790.03039)] and P-minimal structures defined in [\textit{H. Schoutens}, J. Symb. Log. 79, No. 2, 355--409 (2014; Zbl 1337.03055)]. Other examples include topologically totally transcendental first order topological structures of \textit{A. Pillay} [J. Symb. Log. 52, 763--778 (1987; Zbl 0628.03022)], and Zariski structures of \textit{E. Hrushovski} and \textit{B. Zilber} [J. Am. Math. Soc. 9, No. 1, 1--56 (1996; Zbl 0843.03020)].

Recommendations

• The non-axiomatizability of o-minimality
• scientific article; zbMATH DE number 2047478
• Pseudo-finite sets, pseudo-o-minimality
• New Computational Paradigms
• scientific article; zbMATH DE number 637397

Cites work

• A version of o-minimality for the p-adics
• Cell decompositions of C-minimal structures
• Computability and Logic
• First order topological structures and theories
• Locally o-minimal structures and structures with locally o-minimal open core
• O-minimalism
• One-dimensional fibers of rigid subanalytic sets
• Reducts of (C, +, ·) which contain +
• Structures having o-minimal open core
• The elementary theory of finite fields
• The non-axiomatizability of o-minimality
• Zariski geometries

This page was built for publication: Computable axiomatizability of elementary classes

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