activity
20162026
most citedForcing with Invariant Measures

1 citations · 1 across the 17 of their papers we have counts for

collaborators
Showing math.LOShow all

10 papers · 1 filter

math.LO2026

Almost-linear Zarankiewicz bounds in -semi-equational theories

Hongyi Gou, Mostafa Mirabi, Mihir Mittal +2

We study multipartite hypergraphs definable in -semi-equational theories and prove almost-linear Zarankiewicz bounds in every fixed arity . If is a -semi-equation…

math.LO2026

Canonical expansions of -germs

Mostafa Mirabi

Let be the field of unary germs at definable in the quasianalytic o-minimal structure of Kaiser-Rolin-Speissegger. We c…

math.LO2026

Limit laws for component-pruned sparse random graphs and percolated tori

Mostafa Mirabi, Saharon Shelah

We prove an zero-one law for a very sparse Erdős-Rényi graph after pruning by component order. Let , where , and delete every component of orde…

math.LO2026

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…

math.LO2026★ 1 cited

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…

math.LO2026

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…

math.LO2023

Computability of Countable Sunflowers

Nathanael Ackerman, Leah Karker, Mostafa Mirabi

We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to…

math.LO2023

Asymptotic Classes of Trees and -categoricity

Mostafa Mirabi

This paper focuses on the characterization of -categorical theories of trees in the following sense: for any -cateorical theory of trees there is a tree pla…

math.LO2021

MS-measurability via coordinatization

Mostafa Mirabi

We study -measurability of structures obtained as expansions of finite-height trees. We show that an admissible nil-interaction coordinatized structure is -measurable whene…

math.LO2016

Definable tree property for uncountable regular cardinals

Mohammad Golshani, Mostafa Mirabi

The primary goal of this paper is to establish a model of wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with…