3 citations · 3 across the 9 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
math.LO2010
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…
math.LO2010
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.