pith. sign in

arxiv: 2405.08211 · v3 · submitted 2024-05-13 · 🧮 math.LO

Simple Homogeneous Structures and Indiscernible Sequence Invariants

Pith reviewed 2026-05-24 00:47 UTC · model grok-4.3

classification 🧮 math.LO
keywords simple theoriesone-basedfinite rankindiscernible sequencesKim-forkingNSOP1quantifier eliminationhomogeneous structures
0
0 comments X

The pith

Every simple theory with quantifier elimination in a finite relational language has finite rank and is one-based.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces invariants F_ind and its dual F_Mb for dependence in indiscernible sequences, along with the definable Morley property and n-resolvability. These are applied to show that the degree of nonminimality can take any positive integer value in an ω-stable theory. The central result proves a conjecture that every simple theory with quantifier elimination in a finite relational language has finite rank and is one-based, relying on types with infinite F_Mb and n-resolvability. Variants of the simple Kim-forking conjecture are established in NSOP1 theories, and F_Mb is shown to be nontrivial in stable theories.

Core claim

We introduce some properties describing dependence in indiscernible sequences: F_ind and its dual F_Mb, the definable Morley property, and n-resolvability. We show that the degree of nonminimality may take on any positive integer value in an ω-stable theory. Proving a conjecture of Koponen, we show that every simple theory with quantifier elimination in a finite relational language has finite rank and is one-based. The arguments closely rely on finding types q with F_Mb(q) = ∞, and on n-resolvability. We prove some variants of the simple Kim-forking conjecture in NSOP1 theories. We show that the quantity F_Mb is in fact nontrivial even in stable theories.

What carries the argument

The invariants F_ind and F_Mb on indiscernible sequences, which quantify dependence along such sequences in simple and NSOP1 theories.

If this is right

  • The degree of nonminimality can take any positive integer value in ω-stable theories.
  • Every simple theory with quantifier elimination in a finite relational language has finite rank and is one-based.
  • A global analogue of the simple Kim-forking conjecture holds with infinitely many variables in every NSOP1 theory.
  • Kim-forking satisfies finite-variable versions when F_Mb(p) is finite.
  • F_Mb takes nontrivial values in stable theories.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The new invariants could be used to study dependence in other classes of theories not covered in the paper.
  • The classification might imply that all homogeneous structures in such simple theories are of bounded complexity.
  • Further study of n-resolvability could reveal when these classification results apply more broadly.

Load-bearing premise

The classification proofs require the existence of types q with F_Mb(q) = infinity and the property of n-resolvability.

What would settle it

A simple theory with quantifier elimination in a finite relational language that has infinite rank or is not one-based would falsify the main claim.

read the original abstract

We introduce some properties describing dependence in indiscernible sequences: $F_{ind}$ and its dual $F_{Mb}$, the definable Morley property, and $n$-resolvability. Applying these properties, we establish the following results: We show that the degree of nonminimality introduced by Freitag and Moosa, which is closely related to $F_{ind}$ (equal in $\mathrm{DCF}_{0}$), may take on any positive integer value in an $\omega$-stable theory, answering a question of Freitag, Jaoui, and Moosa. Proving a conjecture of Koponen, we show that every simple theory with quantifier elimination in a finite relational language has finite rank and is one-based. The arguments closely rely on finding types $q$ with $F_{Mb}(q) = \infty$, and on $n$-resolvability. We prove some variants of the simple Kim-forking conjecture, a generalization of the stable forking conjecture to $\mathrm{NSOP}_{1}$ theories. We show a global analogue of the simple Kim-forking conjecture with infinitely many variables holds in every $\mathrm{NSOP}_{1}$ theory, and show that Kim-forking with a realization of a type $p$ with $\mathrm{F}_{Mb}(p) < \infty$ satisfies a finite-variable version of this result. We then show, in a low $\mathrm{NSOP}_{1}$ theory or when $p$ is isolated, if $p \in S(C)$ has the definable Morley property for Kim-independence, Kim-forking with realizations of $p$ gives a nontrivial instance of the simple Kim-forking conjecture itself. In particular, when $F_{Mb}(p) < \infty$ and $|S^{F_{Mb}(p) + 1}(C)| < \infty$, Kim-forking with realizations of $p$ gives us a nontrivial instance of the simple Kim-forking conjecture. We show that the quantity $F_{Mb}$, motivated in simple and $\mathrm{NSOP}_{1}$ theories by the above results, is in fact nontrivial even in stable theories.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces invariants F_ind and its dual F_Mb, the definable Morley property, and n-resolvability to describe dependence in indiscernible sequences. It applies these to show that the degree of nonminimality can take any positive integer value in an ω-stable theory; proves Koponen's conjecture that every simple theory with quantifier elimination in a finite relational language has finite rank and is one-based (relying on types q with F_Mb(q)=∞ and n-resolvability); establishes variants of the simple Kim-forking conjecture in NSOP1 theories, including a global infinite-variable version and finite-variable cases under definable Morley property or isolation; and shows F_Mb is nontrivial even in stable theories.

Significance. If the central arguments hold, the work supplies new invariants for indiscernible sequences that resolve an open conjecture in the classification of simple theories and yield partial progress on the simple Kim-forking conjecture. The explicit construction of examples realizing every positive integer degree of nonminimality and the demonstration that F_Mb remains nontrivial in stable theories are concrete contributions that strengthen the toolkit for studying forking and independence in model theory.

major comments (2)
  1. [Koponen conjecture proof] The section proving Koponen's conjecture: the argument that every simple theory with QE in a finite relational language has finite rank and is one-based rests on the existence of types q with F_Mb(q)=∞ together with n-resolvability; the manuscript must supply an explicit theorem or construction guaranteeing these two properties hold universally in the target class, as the abstract itself identifies this dependence and it is load-bearing for the classification claim.
  2. [Kim-forking variants] The subsection on finite-variable Kim-forking: the claim that Kim-forking with a realization of p where F_Mb(p)<∞ satisfies a finite-variable version of the simple Kim-forking conjecture requires a verification that the bound |S^{F_Mb(p)+1}(C)|<∞ does not collapse the instance to a trivial or previously known case; without this check the reduction from the global infinite-variable result is not fully substantiated.
minor comments (2)
  1. [Introduction] Notation for F_Mb and F_ind should be introduced with a short table comparing their definitions and duality properties to aid readability.
  2. [Stable theories section] The statement that F_Mb is nontrivial in stable theories would benefit from an explicit example (e.g., a specific stable theory and type) rather than a general existence argument.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback on our manuscript. We address the two major comments point by point below, agreeing where revision is needed to strengthen the presentation.

read point-by-point responses
  1. Referee: [Koponen conjecture proof] The section proving Koponen's conjecture: the argument that every simple theory with QE in a finite relational language has finite rank and is one-based rests on the existence of types q with F_Mb(q)=∞ together with n-resolvability; the manuscript must supply an explicit theorem or construction guaranteeing these two properties hold universally in the target class, as the abstract itself identifies this dependence and it is load-bearing for the classification claim.

    Authors: We agree that the proof of Koponen's conjecture is load-bearing on the existence of types q with F_Mb(q)=∞ and on n-resolvability, as noted in the abstract. The manuscript constructs such types and verifies n-resolvability within the argument for the target class of theories, but we acknowledge that an explicit standalone theorem guaranteeing these properties universally would improve clarity and self-containment. We will add such a theorem (with its proof) in the revised version. revision: yes

  2. Referee: [Kim-forking variants] The subsection on finite-variable Kim-forking: the claim that Kim-forking with a realization of p where F_Mb(p)<∞ satisfies a finite-variable version of the simple Kim-forking conjecture requires a verification that the bound |S^{F_Mb(p)+1}(C)|<∞ does not collapse the instance to a trivial or previously known case; without this check the reduction from the global infinite-variable result is not fully substantiated.

    Authors: We agree that the finite-variable claim under the bound |S^{F_Mb(p)+1}(C)|<∞ requires explicit verification that the resulting instance remains nontrivial. The manuscript already notes that this yields a nontrivial instance when combined with the definable Morley property or isolation, but we will add a dedicated paragraph or example in the revised version confirming that the bound does not reduce to previously known trivial cases, thereby substantiating the reduction from the global result. revision: yes

Circularity Check

0 steps flagged

No circularity: new invariants introduced and applied to independent classification results

full rationale

The paper defines new dependence properties (F_ind, F_Mb, definable Morley property, n-resolvability) in the abstract and applies them to prove external conjectures and answer open questions. The Koponen conjecture proof is described as relying on locating types with F_Mb(q)=∞ and verifying n-resolvability, but these are presented as proof techniques rather than definitions that presuppose the target conclusion. No quoted step equates a derived quantity to a fitted input or reduces the central claim to a self-citation chain. The results on degree of nonminimality, Kim-forking variants, and F_Mb in stable theories are independent of the main classification and do not exhibit self-definitional or renaming patterns. The derivation remains self-contained against the stated assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 4 invented entities

The central claims rest on the new invariants F_ind, F_Mb, the definable Morley property, and n-resolvability being well-defined and useful in the relevant classes of theories; these are introduced in the paper rather than derived from prior literature.

axioms (1)
  • standard math Standard axioms of first-order model theory and the definition of simple and NSOP1 theories
    Invoked throughout to set the ambient context for the new invariants.
invented entities (4)
  • F_ind no independent evidence
    purpose: Measure of dependence along indiscernible sequences
    Newly introduced property; no independent evidence supplied in abstract.
  • F_Mb no independent evidence
    purpose: Dual measure to F_ind
    Newly introduced property; no independent evidence supplied in abstract.
  • definable Morley property no independent evidence
    purpose: Property of types with respect to Kim-independence
    Newly introduced property; no independent evidence supplied in abstract.
  • n-resolvability no independent evidence
    purpose: Technical condition used in proofs
    Newly introduced property; no independent evidence supplied in abstract.

pith-pipeline@v0.9.0 · 5951 in / 1494 out tokens · 18963 ms · 2026-05-24T00:47:28.137524+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Higher-arity distality and forking triviality

    math.LO 2026-05 unverdicted novelty 6.0

    k-triviality collapses to 1-triviality among simple theories, yielding new non-k-ary examples of strongly k-distal theories and implying that certain stable theories are trivial.

Reference graph

Works this paper leans on

93 extracted references · 93 canonical work pages · cited by 1 Pith paper

  1. [1]

    On sets with rank one in simple homogeneous structures

    Ove Ahlman and Vera Koponen. On sets with rank one in simple homogeneous structures. Fundamenta Mathematicae, 228(3):223–250, 2015

  2. [2]

    Model theory of open generalized polygons, Preprint

    Anna-Maria Ammer and Katrin Tent. Model theory of open generalized polygons, Preprint. Available at https://arxiv.org/pdf/2308.03677.pdf. 2023,

  3. [3]

    PhD thesis, University of Leeds, 2013

    Andr ´es Aranda L ´opez.Omega-categorical simple theories. PhD thesis, University of Leeds, 2013

  4. [4]

    Transitivity, lowness and ranks in NSOP1 theories, Preprint

    Byunghan Kim Artem Chernikov and Nicholas Ramsey. Transitivity, lowness and ranks in NSOP1 theories, Preprint. Available at https://arxiv.org/pdf/2006.10486.pdf. 2020,

  5. [5]

    John T. Baldwin. An almost strongly minimal non-Desarguesian projective plane.Transactions of the American Mathematical Society, 342:695–711, 1994

  6. [6]

    John T. Baldwin. Some projective planes of Lenz Barlotti class I.Proceedings of the A.M.S., 123:251–256, 1995

  7. [7]

    Baldwin and K

    John T. Baldwin and K. Holland. Constructingω-stable structures: Rank 2 fields.The Journal of Symbolic Logic, 65:371–391, 2000

  8. [8]

    Baldwin and G

    John T. Baldwin and G. Paolini. Strongly Minimal Steiner Systems I.Journal of Symbolic Logic, 86:1486–1507, 2021. published online Oct 22, 2020arXiv:1903.03541

  9. [9]

    Baldwin and S

    John T. Baldwin and S. Shelah. Randomness and semigenericity.Transactions of the American Mathematical Society, 349:1359–1376, 1997

  10. [10]

    Baldwin and Niandong Shi

    John T. Baldwin and Niandong Shi. Stable generic structures.Annals of Pure and Applied Logic, 79:1–35, 1996

  11. [11]

    Baldwin and V

    John T. Baldwin and V . Verbovskiy. Towards a finer classification of strongly minimal sets. Annals of Pure and Applied Logic, 175, 2024. published on-line: 58 pages, Math Arxiv: https://arxiv.org/pdf/2106.15567.pdf

  12. [12]

    Almost strongly minimal theories II.The Journal of Symbolic Logic, 37:657–660,

    J.T Baldwin. Almost strongly minimal theories II.The Journal of Symbolic Logic, 37:657–660,

  13. [13]

    MR 48#89 ;ZBL 266#02029

  14. [14]

    Itay Ben-Yaacov, Ivan Tomasic, and Frank O. Wagner. The Group Configuration in Simple Theories and Its Applications.Bulletin of Symbolic Logic, 8(2):283 – 298, 2002

  15. [15]

    permutation groups of finite morley rank

    Alexandre Borovik and Gregory Cherlin. permutation groups of finite morley rank. InModel theory with applications to algebra and analysis, volume 2 ofLondon Math. Soc. Lecture Note Ser. 350, page 59–124. Cambridge Univ. Press, 2008

  16. [16]

    Binding groups, permutations groups and modules of finite morley rank.arXiv preprint arXiv:1909.02813, 2019

    Alexandre Borovik and Adrien Deloro. Binding groups, permutations groups and modules of finite morley rank.arXiv preprint arXiv:1909.02813, 2019

  17. [17]

    On some Fra ¨ıss´e’ limits with free amalgamation, Preprint

    Yvon Bossut. On some Fra ¨ıss´e’ limits with free amalgamation, Preprint. Available at https://arxiv.org/pdf/2403.07616.pdf. 2024

  18. [18]

    PhD thesis, University of Notre Dame, 4 2012

    Donald A Brower.Aspects of stability in simple theories. PhD thesis, University of Notre Dame, 4 2012

  19. [19]

    Invariants forω-categorical,ω-stable theories.Israel Journal of Mathematics, 52:65–81, 1985

    Steven Buechler. Invariants forω-categorical,ω-stable theories.Israel Journal of Mathematics, 52:65–81, 1985

  20. [20]

    Local superssimplicity and related concepts.The Journal of Symbolic Logic, 67(2):744–758, 2002

    Enrique Casanovas and Frank O Wagner. Local superssimplicity and related concepts.The Journal of Symbolic Logic, 67(2):744–758, 2002. 61

  21. [21]

    Homogeneity and related topics: An extended bibliography.arXiv preprint arXiv:2111.15429, 2021

    Gregory Cherlin. Homogeneity and related topics: An extended bibliography.arXiv preprint arXiv:2111.15429, 2021

  22. [22]

    Annals of Pure and Applied Logic, 28(2):103–135, 1985

    Gregory Cherlin, Leo Harrington, and Alistair H Lachlan.ℵ 0-categorical,ℵ 0-stable structures. Annals of Pure and Applied Logic, 28(2):103–135, 1985

  23. [23]

    An axiomatic approach to free amalgamation.The Journal of Symbolic Logic, 82(2):648–671, 2017

    Gabriel Conant. An axiomatic approach to free amalgamation.The Journal of Symbolic Logic, 82(2):648–671, 2017

  24. [24]

    Independence in generic incidence structures.The Journal of Symbolic Logic, 84(2):750–780, 2019

    Gabriel Conant and Alex Kruckman. Independence in generic incidence structures.The Journal of Symbolic Logic, 84(2):750–780, 2019

  25. [25]

    Laskowski

    Gabriel Conant and Michael C. Laskowski. Weakly minimal groups with a new predicate.Jour- nal of Mathematical Logic, 20(2):2050011, 2020

  26. [26]

    Generic differential equations are strongly minimal

    Matthew DeVilbiss and James Freitag. Generic differential equations are strongly minimal. Compositio Mathematica, 159(7):1387–1412, 2023

  27. [27]

    De La Nuez Gonzalez

    Valentina Disarlo, Thomas Koberda, and J. De La Nuez Gonzalez. The model theory of the curve graph, Preprint. Available at https://arxiv.org/pdf/2008.10490.pdf. 2023

  28. [28]

    Independence over arbitrary sets in nsop1 theories.Annals of Pure and Applied Logic, 173(2):103058, 2022

    Jan Dobrowolski, Byunghan Kim, and Nicholas Ramsey. Independence over arbitrary sets in nsop1 theories.Annals of Pure and Applied Logic, 173(2):103058, 2022

  29. [29]

    Differential elimination for dynamical models via projections with applications to structural identifiability

    Ruiwen Dong, Christian Goodbrake, Heather A Harrington, and Gleb Pogudin. Differential elimination for dynamical models via projections with applications to structural identifiability. SIAM Journal on Applied Algebra and Geometry, 7(1):194–235, 2023

  30. [30]

    D. Evans. Homogeneous structures,ω-categoricity and amalgamation constructions. Mincourse Bonn, 2013, 2013

  31. [31]

    David Evans.ℵ 0 -categorical structures with a predimension.Annals of Pure and Applied Logic - APAL, 116:157–186, 08 2002

  32. [32]

    David M. Evans. Block transitive Steiner systems with more than one point orbit.J. Combin. Des., 12(6):459–465, 2004

  33. [33]

    Evans and M

    David M. Evans and M. E. Pantano.ℵ 0-categorical structures with arbitrarily fast growth of algebraic closure.Journal of Symbolic Logic, 67:897 – 909, 2002

  34. [34]

    Forking degree and the Borovik-Cherlin conjecture.Mini-Workshop: Topolog- ical and Differential Expansions of o-minimal Structures, Oberwolfach Reports, 19(4):3028– 3030, 2023

    James Freitag. Forking degree and the Borovik-Cherlin conjecture.Mini-Workshop: Topolog- ical and Differential Expansions of o-minimal Structures, Oberwolfach Reports, 19(4):3028– 3030, 2023

  35. [35]

    On the equations of poizat and li´enard.International Mathematics Research Notices, 2023(19):16478–16539, 2023

    James Freitag, R ´emi Jaoui, David Marker, and Joel Nagloo. On the equations of poizat and li´enard.International Mathematics Research Notices, 2023(19):16478–16539, 2023

  36. [36]

    When any three solutions are independent.In- ventiones mathematicae, 230(3):1249–1265, 2022

    James Freitag, R ´emi Jaoui, and Rahim Moosa. When any three solutions are independent.In- ventiones mathematicae, 230(3):1249–1265, 2022

  37. [37]

    The degree of nonminimality is at most 2.Jour- nal of Mathematical Logic, page 2250031, 2023

    James Freitag, R ´emi Jaoui, and Rahim Moosa. The degree of nonminimality is at most 2.Jour- nal of Mathematical Logic, page 2250031, 2023

  38. [38]

    Differential-algebraic permutation groups

    James Freitag, L ´eo Jimenez, and Rahim Moosa. Differential-algebraic permutation groups. arXiv preprint arXiv:2307.11220, 2023

  39. [39]

    Bounding nonminimality and a conjecture of borovik–cherlin

    James Freitag and Rahim Moosa. Bounding nonminimality and a conjecture of borovik–cherlin. Journal of the European Mathematical Society, 2023

  40. [40]

    Algebraic relations between solutions of painlev\’e equations

    James Freitag and Joel Nagloo. Algebraic relations between solutions of painlev\’e equations. arXiv preprint arXiv:1710.03304, 2017

  41. [41]

    Strong minimality and thej-function.Journal of the Eu- ropean Mathematical Society, 20(1):119–136, 2017

    James Freitag and Thomas Scanlon. Strong minimality and thej-function.Journal of the Eu- ropean Mathematical Society, 20(1):119–136, 2017

  42. [42]

    A primer of simple theories.Archive for Mathematical Logic, 41(6):541–580, 2002

    Rami Grossberg, Jos ´e Iovino, and Olivier Lessmann. A primer of simple theories.Archive for Mathematical Logic, 41(6):541–580, 2002

  43. [43]

    Fundamentals of forking.Annals of Pure and Applied Logic, 26(3):245–286, 1984

    Victor Harnik and Leo Harrington. Fundamentals of forking.Annals of Pure and Applied Logic, 26(3):245–286, 1984

  44. [44]

    B. Hart, B. Kim, and A. Pillay. Coordinatisation and canonical bases in simple theories.J. Symbolic Logic, 65:293–309, 2000

  45. [45]

    Coordinatisation and canonical bases in simple theories.The Journal of Symbolic Logic, 65(1):293–309, 2000

    Bradd Hart, Byunghan Kim, and Anand Pillay. Coordinatisation and canonical bases in simple theories.The Journal of Symbolic Logic, 65(1):293–309, 2000. 62

  46. [46]

    B. Herwig. Weightωtypes in stable theory with few types.Journal of Symbolic Logic, 60:51–73, 1995

  47. [47]

    Hrushovski

    E. Hrushovski. A stableℵ 0-categorical pseudoplane. preprinthttps:// people.maths.ox.ac.uk/hrushovski/Some\%20older\%20texts/ stable-alephzero-categorical.pdf, 1988

  48. [48]

    Hrushovski

    E. Hrushovski. A new strongly minimal set.Annals of Pure and Applied Logic, 62:147–166, 1993

  49. [49]

    Totally categorical structures.Transactions of the American Mathematical Society, 313(1):131–159, 1989

    Ehud Hrushovski. Totally categorical structures.Transactions of the American Mathematical Society, 313(1):131–159, 1989

  50. [50]

    Unimodular minimal structures.Journal of the London Mathematical Soci- ety, s2-46(3):385–396, 1992

    Ehud Hrushovski. Unimodular minimal structures.Journal of the London Mathematical Soci- ety, s2-46(3):385–396, 1992

  51. [51]

    First-order model theory of free projective planes.An- nals of Pure and Applied Logic, 172(2):102888, 2021

    Tapani Hyttinen and Gianluca Paolini. First-order model theory of free projective planes.An- nals of Pure and Applied Logic, 172(2):102888, 2021

  52. [52]

    Weak identifiability for differential algebraic systems

    Gabriela Jeronimo and Pablo Solern ´o. Weak identifiability for differential algebraic systems. Advances in Applied Mathematics, 147:102519, 2023

  53. [53]

    On Kim-independence.Journal of the European Mathemat- ical Society, 22, 02 2017

    Itay Kaplan and Nicholas Ramsey. On Kim-independence.Journal of the European Mathemat- ical Society, 22, 02 2017

  54. [54]

    Transitivity of Kim-independence.Advances in Mathemat- ics, 379:107573, 2021

    Itay Kaplan and Nicholas Ramsey. Transitivity of Kim-independence.Advances in Mathemat- ics, 379:107573, 2021

  55. [55]

    Math1050 combinatorial mathematics.https://sites.pitt.edu/ ˜kaveh/Chap7-MATH1050.pdf, 2013

    Kiumars Kaveh. Math1050 combinatorial mathematics.https://sites.pitt.edu/ ˜kaveh/Chap7-MATH1050.pdf, 2013

  56. [56]

    Simplicity, and stability in there.Journal of Symbolic Logic, 66(2):822–836, 2001

    Byunghan Kim. Simplicity, and stability in there.Journal of Symbolic Logic, 66(2):822–836, 2001

  57. [57]

    PhD thesis, University of Notre Dame, 2010

    Byunghan Kim.THE GROUP CONFIGURATION THEOREM AND ITS APPLICATIONS. PhD thesis, University of Notre Dame, 2010

  58. [58]

    From stability to simplicity.Bulletin of Symbolic Logic, 4(1):17–36, 1998

    Byunghan Kim and Anand Pillay. From stability to simplicity.Bulletin of Symbolic Logic, 4(1):17–36, 1998

  59. [59]

    Around stable forking.Fundamenta Mathematicae, 170(1- 2):107–118, 2001

    Byunghan Kim and Anand Pillay. Around stable forking.Fundamenta Mathematicae, 170(1- 2):107–118, 2001

  60. [60]

    Mehrfach transitive operationen algebraischer gruppen.Archiv der Mathe- matik, 41:438–446, 1983

    Friedrich Knop. Mehrfach transitive operationen algebraischer gruppen.Archiv der Mathe- matik, 41:438–446, 1983

  61. [61]

    Some connections between finite and infinite model theory

    Vera Koponen. Some connections between finite and infinite model theory. In Javier Esparza, Christian Michaux, and CharlesEditors Steinhorn, editors,Finite and Algorithmic Model The- ory, London Mathematical Society Lecture Note Series, page 109–139. Cambridge University Press, 2011

  62. [62]

    Binary simple homogeneous structures are supersimple with finite rank.Pro- ceedings of the American Mathematical Society, 144(4):1745–1759, 2016

    Vera Koponen. Binary simple homogeneous structures are supersimple with finite rank.Pro- ceedings of the American Mathematical Society, 144(4):1745–1759, 2016

  63. [63]

    Binary primitive homogeneous simple structures.The Journal of Symbolic Logic, 82(1):183–207, 2017

    Vera Koponen. Binary primitive homogeneous simple structures.The Journal of Symbolic Logic, 82(1):183–207, 2017

  64. [64]

    Supersimpleω-categorical theories and pregeometries.Annals of Pure and Ap- plied Logic, 170(12):102718, 2019

    Vera Koponen. Supersimpleω-categorical theories and pregeometries.Annals of Pure and Ap- plied Logic, 170(12):102718, 2019

  65. [65]

    Simple homogeneous structures, Presentation slides, Homo- geneous Structures, Banff International Research Station

    Vera Koponen. Simple homogeneous structures, Presentation slides, Homo- geneous Structures, Banff International Research Station. 2016. Available at https://pdfs.semanticscholar.org/39d5/96a11077145b8413d221e0598673a7ac222d.pdf

  66. [66]

    Interpolative fusions II: Preservation results, Preprint

    Alex Kruckman, Minh Chieu Tran, and Erik Walsberg. Interpolative fusions II: Preservation results, Preprint. Available at https://arxiv.org/abs/2206.08512. 2022

  67. [67]

    Two conjectures regarding the stability ofω-categorical theories.Fundamenta Mathematicae, 81(2):133–145, 1974

    Alistair Lachlan. Two conjectures regarding the stability ofω-categorical theories.Fundamenta Mathematicae, 81(2):133–145, 1974

  68. [68]

    Laskowski

    Michael C. Laskowski. A simpler axiomatization of the Shelah-Spencer almost sure theory. Israel Journal of Mathematics, 161:157–186, 2007

  69. [69]

    Interpreting groups inω-categorical structures.Journal of Symbolic Logic, 56:1317 – 1324, 1991

    Dugald Macpherson. Interpreting groups inω-categorical structures.Journal of Symbolic Logic, 56:1317 – 1324, 1991. 63

  70. [70]

    Primitive permutation groups of finite Morley rank

    Dugald Macpherson and Anand Pillay. Primitive permutation groups of finite Morley rank. Proceedings of the London Mathematical Society, 3(3):481–504, 1995

  71. [71]

    Some model theory of fibrations and algebraic reductions

    Rahim Moosa and Anand Pillay. Some model theory of fibrations and algebraic reductions. Selecta Mathematica, 20(4):1067–1082, 2014

  72. [72]

    Categoricity in power.Transactions of the American Mathematical Society, 114(2):514–538, 1965

    Michael Morley. Categoricity in power.Transactions of the American Mathematical Society, 114(2):514–538, 1965

  73. [73]

    On the propertiesSOP 2n+1+1, manuscript

    Scott Mutchnik. On the propertiesSOP 2n+1+1, manuscript. 2023

  74. [74]

    Conant-independence in generalized free amalgamation theories, Preprint

    Scott Mutchnik. Conant-independence in generalized free amalgamation theories, Preprint. Available at https://arxiv.org/abs/2210.07527. 2022

  75. [75]

    AnNSOP 1 theory without the existence axiom, preprint

    Scott Mutchnik. AnNSOP 1 theory without the existence axiom, preprint. Available at https://arxiv.org/abs/2407.13082. 2024

  76. [76]

    On algebraic relations between solutions of a generic painlev ´e equation.Journal f ¨ur die reine und angewandte Mathematik (Crelles Journal), 2017(726):1–27, 2017

    Joel Nagloo and Anand Pillay. On algebraic relations between solutions of a generic painlev ´e equation.Journal f ¨ur die reine und angewandte Mathematik (Crelles Journal), 2017(726):1–27, 2017

  77. [77]

    Dependent finitely homogneneous rosy structures.arXiv preprint arXiv:2107.02727, 2021

    Alf Onshuus and Pierre Simon. Dependent finitely homogneneous rosy structures.arXiv preprint arXiv:2107.02727, 2021

  78. [78]

    Computing all identi- fiable functions of parameters for ode models.Systems & Control Letters, 157:105030, 2021

    Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, and Thomas Scanlon. Computing all identi- fiable functions of parameters for ode models.Systems & Control Letters, 157:105030, 2021

  79. [79]

    Multi-experiment pa- rameter identifiability of odes and model theory.SIAM Journal on Applied Algebra and Geom- etry, 6(3):339–367, 2022

    Alexey Ovchinnikov, Anand Pillay, Gleb Pogudin, and Thomas Scanlon. Multi-experiment pa- rameter identifiability of odes and model theory.SIAM Journal on Applied Algebra and Geom- etry, 6(3):339–367, 2022

  80. [80]

    Palac ´ın and F

    D. Palac ´ın and F. O. Wagner. Elimination of hyperimaginaries and stable independence in sim- ple CM-trivial theories.Notre Dame Journal of Formal Logic, 54(3-4), 2013

Showing first 80 references.