Order:
See also
Jan Plaza
State University of New York (SUNY)
  1. Logics of Public Communications.Jan Plaza - 2007 - Synthese 158 (2):165 - 179.
    Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper (part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results and formulate a general method that solves certain (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   124 citations  
  2.  21
    First Order Modal Logic of Closure Spaces with Equality.Jan Plaza - 1986 - Bulletin of the Section of Logic 15 (1):21-25.
    Closure spaces are generalizations of topological spaces, in which the Intersection of two open sets need not be open. The considered logic is related to closure spaces just as the standard logic S4 to topological ones. After describing basic properties of the logic we consider problems of representation of Lindenbaum algebras with some uncountable sets of infinite joins and meets, a notion of equality and a meaning of quantifiers. Results are extended onto the standard logic S4 and they are valid (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  17
    The Craig, Robinson and Beth Theorems for the Modal Logic of Closure Spaces.Jan Plaza - 1986 - Bulletin of the Section of Logic 15 (1):15-18.
    The first order modal logic of closure spaces belongs to the class of equationally definable standard modal logics . One can say, it satisfies no version of the deduction lemma. Nevertheless the Robinson and Beth theorems can be proved by means of an interpretation of modal theories in classical ones. LCS is described in [1], [2], [3], [4]. The logics obtained by adjoining axioms of quasi-equality or of equality to LCS are denoted by LCSQE and LCSE.
    Direct download  
     
    Export citation  
     
    Bookmark  
  4. Artificial Intelligence and Symbolic Computation International Conference, Aisc'98, Plattsburgh, New York, Usa, September 1998 : Proceedings. [REVIEW]Jacques Calmet & Jan Plaza - 1998