Computable Axiomatizability of Elementary Classes
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:TXJBR4HTrecord.jsonopen to challenge →
classification
math.LO
keywords
structuresclassclassesl-structurespseudo-o-minimalrennetalexapply
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.