Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)Strong Completeness and Limited Canonicity for PDL.Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge - 2008 - Journal of Logic, Language and Information 17 (1):69-87.
    Propositional dynamic logic is complete but not compact. As a consequence, strong completeness requires an infinitary proof system. In this paper, we present a short proof for strong completeness of $$\mathsf{PDL}$$ relative to an infinitary proof system containing the rule from [α; β n ]φ for all $$n \in {\mathbb{N}}$$, conclude $$[\alpha;\beta^*] \varphi$$. The proof uses a universal canonical model, and it is generalized to other modal logics with infinitary proof rules, such as epistemic knowledge with common knowledge. Also, we (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A note on the compactness theorem.R. R. Rockingham Gill - 1975 - Mathematical Logic Quarterly 21 (1):377-378.
    Download  
     
    Export citation  
     
    Bookmark  
  • Key notions of Tarski's methodology of deductive systems.Janusz Czelakowski & Grzegorz Malinowski - 1985 - Studia Logica 44 (4):321 - 351.
    The aim of the article is to outline the historical background and the present state of the methodology of deductive systems invented by Alfred Tarski in the thirties. Key notions of Tarski's methodology are presented and discussed through, the recent development of the original concepts and ideas.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)A Note on Algebraic Semantics for S5 with Propositional Quantifiers.Wesley H. Holliday - 2019 - Notre Dame Journal of Formal Logic 60 (2):311-332.
    In two of the earliest papers on extending modal logic with propositional quantifiers, R. A. Bull and K. Fine studied a modal logic S5Π extending S5 with axioms and rules for propositional quantification. Surprisingly, there seems to have been no proof in the literature of the completeness of S5Π with respect to its most natural algebraic semantics, with propositional quantifiers interpreted by meets and joins over all elements in a complete Boolean algebra. In this note, we give such a proof. (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)A Note on Algebraic Semantics for $mathsf{S5}$ with Propositional Quantifiers.Wesley H. Holliday - 2019 - Notre Dame Journal of Formal Logic 60 (2):311-332.
    In two of the earliest papers on extending modal logic with propositional quantifiers, R. A. Bull and K. Fine studied a modal logic S5Π extending S5 with axioms and rules for propositional quantification. Surprisingly, there seems to have been no proof in the literature of the completeness of S5Π with respect to its most natural algebraic semantics, with propositional quantifiers interpreted by meets and joins over all elements in a complete Boolean algebra. In this note, we give such a proof. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Kripke Completeness of Infinitary Predicate Multimodal Logics.Yoshihito Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (3):326-340.
    Kripke completeness of some infinitary predicate modal logics is presented. More precisely, we prove that if a normal modal logic above is -persistent and universal, the infinitary and predicate extension of with BF and BF is Kripke complete, where BF and BF denote the formulas pi pi and x x, respectively. The results include the completeness of extensions of standard modal logics such as , and its extensions by the schemata T, B, 4, 5, D, and their combinations. The proof (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A partially ordered extention of the integers.George Epstein & Helena Rasiowa - 1995 - Studia Logica 54 (3):303 - 332.
    This paper presents a monotonic system of Post algebras of order +* whose chain of Post constans is isomorphic with 012 ... -3-2-1. Besides monotonic operations, other unary operations are considered; namely, disjoint operations, the quasi-complement, succesor, and predecessor operations. The successor and predecessor operations are basic for number theory.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)An approach to tense logic.R. A. Bull - 1970 - Theoria 36 (3):282-300.
    The author's motivation for constructing the calculi of this paper\nis so that time and tense can be "discussed together in the same\nlanguage" (p. 282). Two types of enriched propositional caluli for\ntense logic are considered, both containing ordinary propositional\nvariables for which any proposition may be substituted. One type\nalso contains "clock-propositional" variables, a,b,c, etc., for\nwhich only clock-propositional variables may be substituted and that\ncorrespond to instants or moments in the semantics. The other type\nalso contains "history-propositional" variables, u,v,w, etc., for\nwhich only history-propositional variables may (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • On duality and model theory for polyadic spaces.Sam van Gool & Jérémie Marquès - 2024 - Annals of Pure and Applied Logic 175 (2):103388.
    Download  
     
    Export citation  
     
    Bookmark  
  • Abstract logical structuralism.Jean-Pierre Marquis - 2020 - Philosophical Problems in Science 69:67-110.
    Structuralism has recently moved center stage in philosophy of mathematics. One of the issues discussed is the underlying logic of mathematical structuralism. In this paper, I want to look at the dual question, namely the underlying structures of logic. Indeed, from a mathematical structuralist standpoint, it makes perfect sense to try to identify the abstract structures underlying logic. We claim that one answer to this question is provided by categorical logic. In fact, we claim that the latter can be seen—and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Strong Completeness and Limited Canonicity for PDL.Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge - 2009 - Journal of Logic, Language and Information 18 (2):291-292.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Topological Proofs of Some Rasiowa-Sikorski Lemmas.Robert Goldblatt - 2012 - Studia Logica 100 (1-2):175-191.
    We give topological proofs of Görnemann’s adaptation to Heyting algebras of the Rasiowa-Sikorski Lemma for Boolean algebras; and of the Rauszer-Sabalski generalisation of it to distributive lattices. The arguments use the Priestley topology on the set of prime filters, and the Baire category theorem. This is preceded by a discussion of criteria for compactness of various spaces of subsets of a lattice, including spaces of filters, prime filters etc.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Model existence in non-compact modal logic.Yoshihito Tanaka - 2001 - Studia Logica 67 (1):61-73.
    Predicate modal logics based on Kwith non-compact extra axioms are discussed and a sufficient condition for the model existence theorem is presented. We deal with various axioms in a general way by an algebraic method, instead of discussing concrete non-compact axioms one by one.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)An Infinitary Extension of Jankov’s Theorem.Yoshihito Tanaka - 2007 - Studia Logica 86 (1):111 - 131.
    It is known that for any subdirectly irreducible finite Heyting algebra A and any Heyting algebra B, A is embeddable into a quotient algebra of B, if and only if Jankov’s formula χ A for A is refuted in B. In this paper, we present an infinitary extension of the above theorem given by Jankov. More precisely, for any cardinal number κ, we present Jankov’s theorem for homomorphisms preserving infinite meets and joins, a class of subdirectly irreducible complete κ-Heyting algebras (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Beyond Rasiowa's Algebraic Approach to Non-classical Logics.Josep Maria Font - 2006 - Studia Logica 82 (2):179-209.
    This paper reviews the impact of Rasiowa's well-known book on the evolution of algebraic logic during the last thirty or forty years. It starts with some comments on the importance and influence of this book, highlighting some of the reasons for this influence, and some of its key points, mathematically speaking, concerning the general theory of algebraic logic, a theory nowadays called Abstract Algebraic Logic. Then, a consideration of the diverse ways in which these key points can be generalized allows (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • An Extension of the Lemma of Rasiowa and Sikorski.Jörg Flum - 1998 - Mathematical Logic Quarterly 44 (4):509-514.
    We prove an extension of the Lemma of Rasiowa and Sikorski and give some applications. Moreover, we analyze the relationship to corresponding results on the omission of types.
    Download  
     
    Export citation  
     
    Bookmark