8 found
Sort by:
  1. Michael Kaminski & Nissim Francez (2014). Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic. Studia Logica 102 (3):479-497.
    We show that the relational semantics of the Lambek calculus, both nonassociative and associative, is also sound and complete for its extension with classical propositional logic. Then, using filtrations, we obtain the finite model property for the nonassociative Lambek calculus extended with classical propositional logic.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  2. Michael Kaminski (2010). Extending Free Pregroups with Lower Bounds. Studia Logica 95 (3):417 - 441.
    In this paper, we propose an extension of free pregroups with lower bounds on sets of pregroup elements. Pregroup grammars based on such pregroups provide a kind of an algebraic counterpart to universal quantification over type-variables. In particular, we show how our pregroup extensions can be used for pregroup grammars expressing natural-language coordination and extraction.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Ariel Cohen, Michael Kaminski & Johann A. Makowsky (2008). Notions of Sameness by Default and Their Application to Anaphora, Vagueness, and Uncertain Reasoning. Journal of Logic, Language and Information 17 (3):285-306.
    We motivate and formalize the idea of sameness by default: two objects are considered the same if they cannot be proved to be different. This idea turns out to be useful for a number of widely different applications, including natural language processing, reasoning with incomplete information, and even philosophical paradoxes. We consider two formalizations of this notion, both of which are based on Reiter’s Default Logic. The first formalization is a new relation of indistinguishability that is introduced by default. We (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Nissim Francez & Michael Kaminski (2007). Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages. Studia Logica 87 (2-3):295 - 321.
    The paper presents a generalization of pregroup, by which a freely-generated pregroup is augmented with a finite set of commuting inequations, allowing limited commutativity and cancelability. It is shown that grammars based on the commutation-augmented pregroups generate mildly context-sensitive languages. A version of Lambek’s switching lemma is established for these pregroups. Polynomial parsability and semilinearity are shown for languages generated by these grammars.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Michael Tiomkin & Michael Kaminski (2007). The Modal Logic of Cluster-Decomposable Kripke Interpretations. Notre Dame Journal of Formal Logic 48 (4):511-520.
    We deal with the modal logic of cluster-decomposable Kripke interpretations, present an axiomatization, and prove some additional results regarding this logic.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Michael Kaminski (1997). The Elimination of de Re Formulas. Journal of Philosophical Logic 26 (4):411-422.
    It is shown that de re formulas are eliminable in the modal logic S5 extended with the axiom scheme □∃xφ ⊃ ∃x□φ.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  7. Michael Kaminski & Michael Tiomkin (1996). The Expressive Power of Second-Order Propositional Modal Logic. Notre Dame Journal of Formal Logic 37 (1):35-43.
    It is shown that the expressive power of second-order propositional modal logic whose modalities are S4.2 or weaker is the same as that of second-order predicate logic.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. Michael Kaminski (1988). Nonstandard Connectives of Intuitionistic Propositional Logic. Notre Dame Journal of Formal Logic 29 (3):309-331.