4 papers · 1 filter
Strong Completeness of Provability Logic for Uncountable Languages
Mohammad Golshani, Grigorii Stepanov, Reihane Zoghifard
For an ordinal , we use the Erdős--Rado partition theorem to prove the failure of strong completeness of for modal languages of cardinality $(2^{|λ|+\aleph_0})^{…
Completeness of the Gödel-Löb provability logic for the filter sequence of normal measures
Mohammad Golshani, Reihane Zoghifard
Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic is complete with respect to the filter sequence of normal meas…
A Lindström theorem for intuitionistic first-order logic
Grigory Olkhovikov, Guillermo Badia, Reihane Zoghifard
We extend the main result of (G. Badia and G. Olkhovikov. A Lindström theorem for intuitionistic propositional logic. Notre Dame Journal of Formal Logic, 61 (1): 11--30 (2020)) to…
Probability Logic: A Model Theoretic Perspective
Massoud Pourmahdian, Reihane Zoghifard
In this paper (propositional) probability logic () is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for -additive p…