Completeness of intermediate logics with doubly negated axioms
Mohammad Ardeshir, Mojtaba Mojtahedi · Mathematical logic quarterly · 2013
Let denote a first‐order logic in a language that contains infinitely many constant symbols and also containing intuitionistic logic . By , we mean the associated logic axiomatized by the double negation of the universal closure of the axioms of plus . We shall show that if is strongly complete for a class of Kripke models , then is strongly complete for the class of Kripke models that are ultimately in .