From the 1 of 9 linked papers with an AI index.
1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Limit laws for component-pruned sparse random graphs and percolated tori
Mostafa Mirabi, Saharon Shelah
The paper establishes monadic second‑order (MSO₂) zero‑one laws for very sparse Erdős–Rényi graphs after deleting small components, and derives first‑order limit laws for bond perc…
The Failure of Stable Composition for Equivalence Relations in Simple Theories
Mostafa Mirabi
Casanovas and Potier proved that algebraic quantification preserves stability of formulas. They also gave a nonsimple example, answering a question of Laskowski, showing that the a…
Forcing with Invariant Measures
Nathanael Ackerman, Cameron Freer, Mohammad Golshani +2
This paper introduces a model-theoretic generalization of the notion of forcing with random reals, in which forcing gives rise to random generic structures. Specifically, we consid…
On the computability of cofinal Fraïssé limits
Nathanael Ackerman, Cameron Freer, Mostafa Mirabi
For any collection of finite structures closed under isomorphism (i.e., an age) which has the Hereditary Property (HP), the Joint Embedding Property (JEP), and the Cofinal Amalgama…