34 found
Order:
  1. Logics for Epistemic Programs.Alexandru Baltag & Lawrence S. Moss - 2004 - Synthese 139 (2):165 - 224.
    We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   109 citations  
  2. Logics for the Relational Syllogistic.Ian Pratt-Hartmann & Lawrence S. Moss - 2009 - Review of Symbolic Logic 2 (4):647-683.
    The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause. The logics we present are extensions of the classical syllogistic, and we pay special attention to the question of whether reductio (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  3.  13
    Boolean Semantics for Natural Language.Lawrence S. Moss - 1987 - Journal of Symbolic Logic 52 (2):554-555.
  4.  25
    Topological Reasoning and the Logic of Knowledge.Andrew Dabrowski, Lawrence S. Moss & Rohit Parikh - 1996 - Annals of Pure and Applied Logic 78 (1-3):73-110.
    We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logic is in subset spaces , and we obtain complete axiomatizations for the sentences which hold in these interpretations. In addition, we axiomatize the validities of the smaller class of topological spaces in a system we call topologic . We also prove decidability for these two systems. Our results on topologic relate (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   37 citations  
  5.  19
    Syllogistic Logic with Cardinality Comparisons, on Infinite Sets.Lawrence S. Moss & Selçuk Topal - 2020 - Review of Symbolic Logic 13 (1):1-22.
    This article enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: All x are y and Some x are y, There are at least as many x as y, and There are more x than y. Here x and y range over subsets of a given infinite set. Moreover, x and y may appear complemented, with the natural meaning. We formulate (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  21
    The Undecidability of Iterated Modal Relativization.Joseph S. Miller & Lawrence S. Moss - 2005 - Studia Logica 79 (3):373-407.
    In dynamic epistemic logic and other fields, it is natural to consider relativization as an operator taking sentences to sentences. When using the ideas and methods of dynamic logic, one would like to iterate operators. This leads to iterated relativization. We are also concerned with the transitive closure operation, due to its connection to common knowledge. We show that for three fragments of the logic of iterated relativization and transitive closure, the satisfiability problems are fi1 11–complete. Two of these fragments (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  7.  28
    Coalgebraic logic.Lawrence S. Moss - 1999 - Annals of Pure and Applied Logic 96 (1-3):277-317.
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   18 citations  
  8.  29
    Finite Models Constructed From Canonical Formulas.Lawrence S. Moss - 2007 - Journal of Philosophical Logic 36 (6):605 - 640.
    This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229-237, 1975). There are two ways in which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113-118, 1981). The point is to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  9.  79
    Quantum Logic as Motivated by Quantum Computing.J. Michael Dunn, Tobias J. Hagge, Lawrence S. Moss & Zhenghan Wang - 2005 - Journal of Symbolic Logic 70 (2):353 - 359.
  10.  21
    The Soundness of Internalized Polarity Marking.Lawrence S. Moss - 2012 - Studia Logica 100 (4):683-704.
    This paper provides a foundation for the polarity marking technique introduced by David Dowty [3] in connection with monotonicity reasoning in natural language and in linguistic analyses of negative polarity items based on categorial grammar. Dowty's work is an alternative to the better-known algorithmic approach first proposed by Johan van Benthem [11], and elaborated by Víctor Sánchez Valencia [10]. Dowty's system internalized the monotonicity/polarity markings by generating strings using a categorial grammar whose categories already contain the markings that the earlier (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  9
    Quantum Logic as Motivated by Quantum Computing.J. Michael Dunn, Tobias J. Hagge, Lawrence S. Moss & Zhenghan Wang - 2005 - Journal of Symbolic Logic 70 (2):353-359.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  12.  43
    Modal Correspondence for Models.Jon Barwise & Lawrence S. Moss - 1998 - Journal of Philosophical Logic 27 (3):275-294.
    This paper considers the correspondence theory from modal logic and obtains correspondence results for models as opposed to frames. The key ideas are to consider infinitary modal logic, to phrase correspondence results in terms of substitution instances of a given modal formula, and to identify bisimilar model-world pairs.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  13.  19
    Non-Wellfounded Set Theory.Lawrence S. Moss - 2008 - Stanford Encyclopedia of Philosophy.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  20
    Power Set Recursion.Lawrence S. Moss - 1995 - Annals of Pure and Applied Logic 71 (2):247-306.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15.  41
    Grammar Formalisms Viewed as Evolving Algebras.David E. Johnson & Lawrence S. Moss - 1994 - Linguistics and Philosophy 17 (6):537 - 560.
    We consider the use ofevolving algebra methods of specifying grammars for natural languages. We are especially interested in distributed evolving algebras. We provide the motivation for doing this, and we give a reconstruction of some classic grammar formalisms in directly dynamic terms. Finally, we consider some technical questions arising from the use of direct dynamism in grammar formalisms.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  16.  41
    Editors' Introduction: The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing. [REVIEW]J. Michael Dunn, Lawrence S. Moss & Zhenghan Wang - 2013 - Journal of Philosophical Logic 42 (3):443-459.
  17.  37
    Syllogistic Logic with Comparative Adjectives.Lawrence S. Moss - 2011 - Journal of Logic, Language and Information 20 (3):397-417.
    This paper adds comparative adjectives to two systems of syllogistic logic. The comparatives are interpreted by transitive and irreflexive relations on the underlying domain. The main point is to obtain sound and complete axiomatizations of the valid formulas in the logics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  27
    Barbara H. Partee, Alice ter Meulen, and Robert E. Wall. Mathematical Methods in Linguistics. Studies in Linguistics and Philosophy, Vol. 30. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1990, Xx + 663 Pp. [REVIEW]Lawrence S. Moss - 1992 - Journal of Symbolic Logic 57 (1):271-272.
  19.  41
    Joseph S. Miller Lawrence S. Moss.Lawrence S. Moss - 2001 - Studia Logica 68:1-37.
  20. Logic, Language, Information, and Computation: 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings (Lecture Notes in Computer Science Book 9160).Valeria Correa Vaz De Paiva, Ruy de Queiroz, Lawrence S. Moss, Daniel M. Leivant & Anjolina G. De Oliveira - 2015 - Springer.
  21. Logic, Langage and Computation, Volume 2.Lawrence S. Moss, Jonathan Ginzburg & Maarten de Rijke (eds.) - 1999 - Center for the Study of Language and Inf.
     
    Export citation  
     
    Bookmark  
  22.  19
    Exploring Logical Dynamics, Johan van Benthem. [REVIEW]Lawrence S. Moss - 2000 - Journal of Logic, Language and Information 9 (2):261-263.
    Direct download  
     
    Export citation  
     
    Bookmark  
  23.  51
    Special Issue on the Occasion of Johan van Benthem’s 60th Birthday—Editorial.Hans van Ditmarsch & Lawrence S. Moss - 2009 - Journal of Philosophical Logic 38 (6):587-588.
  24.  20
    Ann. Pure Appl. Logic : Erratum to “Coalgebraic Logic” 96 277–317.Lawrence S. Moss - 1999 - Annals of Pure and Applied Logic 99 (1-3):241-259.
  25.  7
    Exploring the Landscape of Relational Syllogistic Logics.Alex Kruckman & Lawrence S. Moss - 2021 - Review of Symbolic Logic 14 (3):728-765.
    This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and complexity results for a natural subfamily of relational syllogistic logics, parametrized by constructors for terms and for sentences.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  23
    Books Received. [REVIEW]Janusz Czelakowski & Lawrence S. Moss - 1991 - Studia Logica 50 (1):425-430.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  27.  34
    Exploring Logical Dynamics, Johan Van Benthem.Lawrence S. Moss - 2000 - Journal of Logic, Language and Information 9 (2):261-263.
  28.  33
    The Logic of Recursive Equations.A. J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss & Glen T. Whitney - 1998 - Journal of Symbolic Logic 63 (2):451-478.
    We study logical systems for reasoning about equations involving recursive definitions. In particular, we are interested in "propositional" fragments of the functional language of recursion FLR [18, 17], i.e., without the value passing or abstraction allowed in FLR. The "pure," propositional fragment FLR 0 turns out to coincide with the iteration theories of [1]. Our main focus here concerns the sharp contrast between the simple class of valid identities and the very complex consequence relation over several natural classes of models.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  29.  6
    Edward L. Keenan and Leonard M. Faltz. Boolean Semantics for Natural Language. Synthese Language Library, Vol. 23. D. Reidel Publishing Company, Dordrecht, Boston, and Lancaster, 1985, Xii + 387 Pp. [REVIEW]Lawrence S. Moss - 1987 - Journal of Symbolic Logic 52 (2):554-555.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  23
    Dynamic Interpretations of Constraint-Based Grammar Formalisms.Lawrence S. Moss & David E. Johnson - 1995 - Journal of Logic, Language and Information 4 (1):61-79.
    We present a rendering of some common grammatical formalisms in terms of evolving algebras. Though our main concern in this paper is on constraint-based formalisms, we also discuss the more basic case of context-free grammars. Our aim throughout is to highlight the use of evolving algebras as a specification tool to obtain grammar formalisms.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  31.  12
    Review: Edward L. Keenan, Leonard M. Faltz, Boolean Semantics for Natural Language. [REVIEW]Lawrence S. Moss - 1987 - Journal of Symbolic Logic 52 (2):554-555.
  32.  8
    2010 North American Annual Meeting of the Association for Symbolic Logic.Alexander Razborov, Bob Coecke, Zoé Chatzidakis, Bjørn Kjos, Nicolaas P. Landsman, Lawrence S. Moss, Dilip Raghavan, Tom Scanlon, Ernest Schimmerling & Henry Towsner - 2011 - Bulletin of Symbolic Logic 17 (1):127-154.
  33.  33
    Introduction.David E. Johnson & Lawrence S. Moss - 1997 - Linguistics and Philosophy 20 (6):571-574.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  34. Review: Barbara H. Partee, Alice ter Meulen, Robert E. Wall, Mathematical Methods in Linguistics. [REVIEW]Lawrence S. Moss - 1992 - Journal of Symbolic Logic 57 (1):271-272.