profiles

ArXiv ArXiv zbMATH zbMATH ORCID ORCID: 0000-0003-4562-4178 MathSciNet MathSciNet MathOverflow MathOverflow


mathematical research areas
Martin’s Maximum (MM), Proper Forcing Axiom (PFA), forcing with models as side conditions iterated forcing, trees


other interests
Inner model theory, Axioms of Determinacy, iterated ultrapower constructions


publications

  • Mohammadpour, R. (2017). On certain maximality principles. Bull. Iranian Math. Soc., 43(5), 1259–1264. (publisher , arXiv)
  • Golshani, M., & Mohammadpour, R. (2018). The tree property at double successors of singular cardinals of uncountable cofinality. Ann. Pure Appl. Logic, 169(2), 164–175. (publisher , arXiv)
  • Mohammadpour, R., & Veličković, B. (2021). Guessing models and the approachability ideal. J. Math. Log., 21(2), Paper No. 2150003, 35. (publisher , arXiv)
  • Mohammadpour, R. (2021). Almost strong properness. Proc. Amer. Math. Soc., 149(12), 5359–5365. (publisher , arXiv)
  • Mohammadpour, R. (2021). Indestructible Guessing Models And The Approximation Property. In M. Kada (Ed.), RIMS Kōkyūroku (Vol. 2213). Research Institute for Mathematical Sciences. (publisher , arXiv)
  • Mohammadpour, R. (2022). A Road To Compactness Through Guessing Models. ( arXiv)
  • Golshani, M., & Mohammadpour, R. (2022). Cardinal Collapsing and Product Forcing. In H. Sakai (Ed.), RIMS Kōkyūroku (Vol. 2261, pp. 103–107). Research Institute for Mathematical Sciences. (publisher , arXiv)
  • Mohammadpour, R. (2023). New methods in forcing iteration and applications [thesis abstract]. Bull. Symb. Log., 29(2), 300–302. (publisher )
  • Mohammadpour, R. (2023). Specialising trees with small approximations I. J. Symb. Log., 88(2), 640–663. (publisher , arXiv)
  • Mohammadpour, R., & Veličković, B. (2025). On indestructible strongly guessing models. The Journal of Symbolic Logic, 1–27. (publisher , arXiv)