Rahman Mohammadpour

dblp:210/6589 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2026
0000-0003-4562-4178ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2026 On Indestructible strongly Guessing Models
abstract
Abstract In [15] we defined and proved the consistency of the principle upper G upper M Superscript plus Baseline left parenthesis omega 3 comma omega 1 right parenthesis $\mathrm {GM}^+(\omega _3,\omega _1)$ G M + ( ω 3 , ω 1 ) which implies that many consequences of strong forcing axioms hold simultaneously at omega 2 $\omega _2$ ω 2 and omega 3 $\omega _3$ ω 3 . In this paper we formulate a strengthening of upper G upper M Superscript plus Baseline left parenthesis omega 3 comma omega 1 right parenthesis $\mathrm {GM}^+(\omega _3,\omega _1)$ G M + ( ω 3 , ω 1 ) that we call upper S upper G upper M Superscript plus Baseline left parenthesis omega 3 comma omega 1 right parenthesis $\mathrm {SGM}^+(\omega _3,\omega _1)$ S G M + ( ω 3 , ω 1 ) . We also prove, modulo the consistency of two supercompact cardinals, that upper S upper G upper M Superscript plus Baseline left parenthesis omega 3 comma omega 1 right parenthesis $\mathrm {SGM}^+(\omega _3,\omega _1)$
Rahman Mohammadpour, Boban Velickovic
J. Symb. Log.1
2023 Specialising Trees with Small Approximations I
abstract
Abstract Assuming $\mathrm{PFA}$ , we shall use internally club $\omega _1$ -guessing models as side conditions to show that for every tree T of height $\omega _2$ without cofinal branches, there is a proper and $\aleph _2$ -preserving forcing notion with finite conditions which specialises T. Moreover, the forcing has the $\omega _1$ -approximation property.
Rahman Mohammadpour
J. Symb. Log.1
2018 The tree property at double successors of singular cardinals of uncountable cofinality
Mohammad Golshani, Rahman Mohammadpour
Ann. Pure Appl. Log.2