2 papers
math.LO2026
Strong completeness of the logic J
Juan P. Aguilera, Grigorii Stepanov
We prove that the polymodal logic is strongly complete with respect to \textit{-bouquets}, a topological refinement of its Kripke semantics. In particular,…
math.LO2026
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}…