Computable axiomatizability of elementary classes
From MaRDI portal
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.
Recommendations
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)