On supersimplicity and lovely pairs of cats
classification
🧮 math.LO
keywords
lovelypairsprovestrongersupersimplicitythenvariantcats
read the original abstract
We prove that the definition of supersimplicity in metric structures from \cite{pezz:Morley} is equivalent to an \textit{a priori} stronger variant. This stronger variant is then used to prove that if $T$ is a supersimple Hausdorff cat then so is its theory of lovely pairs.
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.