Completeness and absolute H-closedness of topological semilattices
نویسندگان
چکیده
منابع مشابه
Metrical common fixed point theorems without completeness and closedness
* Correspondence: [email protected] Department of Mathematics and Humanities, S.V. National Institute of Technology, Surat, Gujarat, India Full list of author information is available at the end of the article Abstract In this article, we point out that some recent results proved in Babu and Alemayehu are corollaries of the main result of an article due to Ali and Imdad. However, combinin...
متن کاملA topological completeness theorem
We prove a topological completeness theorem for innnitary geometric theories with respect to sheaf models. The theorem extends a classical result of Makkai and Reyes, stating that any topos with enough points has an open spatial cover. We show that one can achieve in addition that the cover is connected and locally connected.
متن کاملCompleteness of second-order propositional S4 and H in topological semantics
We add propositional quantifiers to the propositional modal logic S4 and to the propositional intuitionsitic logic H, introducing axiom schemes that are the natural analogs to axiom schemes typically used for first-order quantifiers in classical logic. We show that the resulting logics are sound and complete for a topological semantics extending, in a natural way, the topological semantics for ...
متن کاملTopological completeness of extensions of S4
Perhaps the most celebrated topological completeness result in modal logic is the McKinseyTarski theorem that if we interpret modal diamond as topological closure, then S4 is complete for the real line or indeed any dense-in-itself separable metrizable space [10]. This result was proved before relational semantics for modal logic was introduced. In the last 15 years, utilizing relational semant...
متن کاملOn Topological Completeness of Regular Tree Languages
We identify the class of Σ1–inductive sets studied by Moschovakis as a set theoretical generalization of the class (1, 3) of the Rabin-Mostowski index hierarchy of alternating automata on infinite trees. That is, we show that every tree language recognized by an alternating automaton of index (1, 3) is Σ1–inductive, and exhibit an automaton whose language is complete in this class w.r.t. contin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2019
ISSN: 0166-8641
DOI: 10.1016/j.topol.2019.04.001