3 citations · 3 across the 9 of their papers we have counts for
11 papers
An infinitary generalization of the Brauer-Schur theorem
Shahram Mohsenipour
We prove an infinitary version of the Brauer-Schur theorem.
On the infinitary van der Waerden Theorem
Shahram Mohsenipour
We give a purely combinatorial proof for the infinitary van der Waerden's theorem.
A note on a sheaf of real regular functions
Shahram Mohsenipour
Coste and Roy in 1979 defined a structural sheaf on the real Zariski spectrum of a semi-real ring and asked whether the ring of the global sections is where $\s…
Finite sums of arithmetic progressions
Shahram Mohsenipour
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
Discrete orderings in the real spectrum
Shahram Mohsenipour
We study discrete orderings in the real spectrum of a commutative ring by defining discrete prime cones and give an algebro-geometric meaning to some kind of diophantine problems o…
On finitary Hindman's numbers
Shahram Mohsenipour, Saharon Shelah
Spencer asked whether the Paris-Harrington version of the Folkman-Sanders theorem has primitive recursive upper bounds. We give a positive answer to this question.
On a question of Silver about gap-two cardinal transfer principles
Mohammad Golshani, Shahram Mohsenipour
Assuming the existence of a Mahlo cardinal, we produce a generic extension of Gödel's constructible universe , in which the transfer principles $(\aleph_2, \aleph_0) \to (\aleph…
Set mappings on 4-tuples
Shahram Mohsenipour, Saharon Shelah
In this paper we study set mappings on 4-tuples. We continue a previous work of Komjath and Shelah by getting new finite bounds on the size of free sets in a generic extension. Thi…
On Keisler singular-like models II
Shahram Mohsenipour
Keisler proved that if is a strong limit cardinal and is a singular cardinal, then the transfer relation holds. In a previous paper, we studied initial…
Model Theory of the Inaccessibility Scheme
Shahram Mohsenipour
Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has…
Hierarchies of Subsystems of Weak Arithmetic
Shahram Mohsenipour
We completely characterize the logical hierarchy of various subsystems of weak arithmetic, namely: ZR, ZR + N, ZR + GCD, ZR + Bez, OI + N, OI + GCD, OI + Bez.