pith. sign in

arxiv: 1804.03254 · v2 · pith:XMNGC4D6new · submitted 2018-04-09 · 🧮 math.LO

An example of a new simple theory

classification 🧮 math.LO
keywords keislerordersimpletheoryabovebarelyblocksbuilding
0
0 comments X
read the original abstract

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a result we prove in ZFC that there are incomparable classes in Keisler's order.

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.