#ModelTheory
A countable copy of the real numbers. #math #LowenheimSkolem #ModelTheory #RealNumbers
November 7, 2026 at 11:52 PM
Quantum error correction and model theory converge: the Pauli group is the Fraïssé limit of finite alternating spaces, connecting simplicity theory to stabilizer codes through forking, logical errors, and syndrome relationships.

#QuantumErrorCorrection #ModelTheory #Research
Simplicity Theory Meets Quantum Error Correction: The Pauli Group as Fraïssé Limit
arxiv.org
November 1, 2026 at 3:35 AM
Connects model theory's Shelah classification to quantum observables via Todorčević trichotomy. Shows NIP observables possess Baire-1 idealized responses forming Rosenthal compacta, revealing phase transitions through topological invariants.

#QuantumMechanics #ModelTheory #Research
Classification of Bipartite Observables II: NIP Observables and the Todorčević Trichotomy
arxiv.org
October 30, 2026 at 8:54 PM
Connects model theory's Shelah classification to quantum observables via Todorčević trichotomy. Shows NIP observables possess Baire-1 idealized responses forming Rosenthal compacta, revealing phase transitions through topological invariants.

#QuantumMechanics #ModelTheory #Research
Classification of Bipartite Observables II: NIP Observables and the Todorčević Trichotomy
arxiv.org
October 30, 2026 at 8:54 PM
New at #SEP: First-order Model Theory https://plato.stanford.edu/entries/modeltheory-fo/
January 25, 2024 at 6:31 PM
Very excited about this new preprint with Kyle Gannon and Krzysztof Krupinski!

"Definable convolution and idempotent Keisler measures III. Generic stability, generic transitivity, and revised Newelski's conjecture"

arxiv.org/abs/2406.00912

#ModelTheory #math
Definable convolution and idempotent Keisler measures III. Generic...
We study idempotent measures and the structure of the convolution semigroups of measures over definable groups. We isolate the property of generic transitivity and demonstrate that it is...
arxiv.org
June 5, 2024 at 8:24 PM
descriptive-complexity is a Lean 4 library I developed to formalize complexity classes and prove hardness results with no computation model: a class is a logic, a completeness proof is a definability witness plus a first-order reduction. Karp's 21 problems are all there.

github.com/PierreSenell...
GitHub - PierreSenellart/descriptive-complexity: A Lean 4 library for descriptive complexity: FO reductions and SO-defined polynomial hierarchy, on top of Mathlib's ModelTheory
A Lean 4 library for descriptive complexity: FO reductions and SO-defined polynomial hierarchy, on top of Mathlib's ModelTheory - PierreSenellart/descriptive-complexity
github.com
July 27, 2026 at 2:40 PM
¿Dónde se traza la línea entre estructuras matemáticas “simples” y “complejas”? A la 13:00, Julia Wolf @cambridgemaths.bsky.social habla de ello en el #ICMAT. También puede seguirse en us02web.zoom.us/j/8539085639...
#Matemáticas #ICMAT #ModelTheory
February 6, 2026 at 11:53 AM