Showing math.LOShow all
3 papers · 1 filter
math.LO2026
Combinatorics in 1-semi-equational theories
Mervyn Tong
We give direct combinatorial proofs that 1-semi-equational theories satisfy two combinatorial properties that imply the non-interpretability of certain fields. Our main result is t…
math.LO2026
Homogeneous hypergraph regularity lemmas via -strong honest definitions
Mervyn Tong
We prove that -uniform hypergraphs definable in an NIP strongly -distal structure satisfy a homogeneous regularity lemma -- they can be partitioned into a bounded number…
math.LO2026
Higher-arity distality and forking triviality
Mervyn Tong
Answering a question of Goode, we show that -triviality collapses to (1-)triviality among simple theories. In particular, every stable theory with quantifier elimination in a re…