| 2012 | ||
|---|---|---|
| 58 | Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa: Well-Pointed Coalgebras (Extended Abstract). FoSSaCS 2012: 89-103 | |
| 57 | Lawrence S. Moss, Erik Wennstrom, Glen T. Whitney: A Complete Logical System for the Equality of Recursive Terms for Sets. Logic and Program Semantics 2012: 180-203 | |
| 56 | Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss: Automatic Sequences and Zip-Specifications CoRR abs/1201.3251: (2012) | |
| 2011 | ||
| 55 | Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa: Power-Set Functors and Saturated Trees. CSL 2011: 5-19 | |
| 54 | Lawrence S. Moss: Connections of coalgebra and semantic modeling. TARK 2011: 28-36 | |
| 53 | Lawrence S. Moss: Syllogistic Logic with Comparative Adjectives. Journal of Logic, Language and Information 20(3): 397-417 (2011) | |
| 2010 | ||
| 52 | Stefan Milius, Lawrence S. Moss, Daniel Schwencke: CIA Structures and the Semantics of Recursion. FOSSACS 2010: 312-327 | |
| 51 | Lawrence S. Moss: Logics for Two Fragments beyond the Syllogistic Boundary. Fields of Logic and Computation 2010: 538-564 | |
| 50 | Lawrence S. Moss: Syllogistic Logics with Verbs. J. Log. Comput. 20(4): 947-967 (2010) | |
| 49 | Lawrence S. Moss: A Note on Expressive Coalgebraic Logics for Finitary Set Functors. J. Log. Comput. 20(5): 1101-1111 (2010) | |
| 2009 | ||
| 48 | Lawrence S. Moss: Natural Logic and Semantics. Amsterdam Colloquium on Logic, Language and Meaning 2009: 84-93 | |
| 47 | Lawrence S. Moss: Intersecting Adjectives in Syllogistic Logic. MOL 2009: 223-237 | |
| 46 | Stefan Milius, Lawrence S. Moss: The Category Theoretic Solution of Recursive Program Schemes CoRR abs/0904.2385: (2009) | |
| 45 | Hans P. van Ditmarsch, Lawrence S. Moss: Special Issue on the Occasion of Johan van Benthem's 60th Birthday - Editorial. J. Philosophical Logic 38(6): 587-588 (2009) | |
| 2008 | ||
| 44 | Ian Pratt-Hartmann, Lawrence S. Moss: Logics for the Relational Syllogistic CoRR abs/0808.0521: (2008) | |
| 43 | Lawrence S. Moss: Confusion of memory. Inf. Process. Lett. 107(3-4): 114-119 (2008) | |
| 42 | Stefan Milius, Lawrence S. Moss: Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59]. Theor. Comput. Sci. 403(2-3): 409-415 (2008) | |
| 2007 | ||
| 41 | Rohit Parikh, Lawrence S. Moss, Chris Steinsvold: Topology and Epistemic Logic. Handbook of Spatial Logics 2007: 299-341 | |
| 40 | Lawrence S. Moss: Finite Models Constructed from Canonical Formulars. J. Philosophical Logic 36(6): 605-640 (2007) | |
| 2006 | ||
| 39 | Lawrence S. Moss: Recursive Program Schemes: Past, Present, and Future. AMAST 2006: 2 | |
| 38 | Lawrence S. Moss: Uniform Functors on Sets. Essays Dedicated to Joseph A. Goguen 2006: 420-448 | |
| 37 | Lawrence S. Moss: Recursion Theorems and Self-Replication Via Text Register Machine Programs. Bulletin of the EATCS 89: 171-182 (2006) | |
| 36 | Lawrence S. Moss, Ignacio D. Viglizzo: Final coalgebras for functors on measurable spaces. Inf. Comput. 204(4): 610-636 (2006) | |
| 35 | Stefan Milius, Lawrence S. Moss: The category-theoretic solution of recursive program schemes. Theor. Comput. Sci. 366(1-2): 3-59 (2006) | |
| 2005 | ||
| 34 | Stefan Milius, Lawrence S. Moss: The Category Theoretic Solution of Recursive Program Schemes. CALCO 2005: 293-312 | |
| 33 | J. Michael Dunn, Tobias J. Hagge, Lawrence S. Moss, Zhenghan Wang: Quantum logic as motivated by quantum computing. J. Symb. Log. 70(2): 353-359 (2005) | |
| 32 | Lawrence S. Moss: Introduction: special issue on selected papers from the Fifth Workshop on Coalgebraic Methods in Computer Science. Mathematical Structures in Computer Science 15(3): 407-408 (2005) | |
| 31 | Lawrence S. Moss: Joint review of "Introduction To Natural Computation by Dana H. Ballard"; MIT Press, 1997, ISBN 0-262-52258-6 and "Mathematical Methods in Artificial Intelligence by Edward A. Bender", IEEE Press, 1996 ISBN 0-8186-7200-5. SIGACT News 36(1): 21-24 (2005) | |
| 30 | Joseph S. Miller, Lawrence S. Moss: The Undecidability of Iterated Modal Relativization. Studia Logica 79(3): 373-407 (2005) | |
| 2004 | ||
| 29 | Lawrence S. Moss, Ignacio D. Viglizzo: Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories. Electr. Notes Theor. Comput. Sci. 106: 279-295 (2004) | |
| 28 | Lawrence S. Moss, Hans-Jörg Tiede: Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001.: and "Automata, logics, and infinite games" by E.Grädel, W. Thomas, and T. Wilke. Springer-Verlag. SIGACT News 35(1): 8-12 (2004) | |
| 2003 | ||
| 27 | Lawrence S. Moss: Recursion and corecursion have the same equational logic. Theor. Comput. Sci. 294(1/2): 233-267 (2003) | |
| 2002 | ||
| 26 | Lawrence S. Moss: Preface. Electr. Notes Theor. Comput. Sci. 65(1): 365-366 (2002) | |
| 2001 | ||
| 25 | Lawrence S. Moss: Simple Equational Specifications of Rational Arithmetic. Discrete Mathematics & Theoretical Computer Science 4(2): 291-300 (2001) | |
| 24 | Lawrence S. Moss, Richard T. Oehrle: Preface. Electr. Notes Theor. Comput. Sci. 53: 1-2 (2001) | |
| 23 | Lawrence S. Moss: Parametric corecursion. Theor. Comput. Sci. 260(1-2): 139-163 (2001) | |
| 2000 | ||
| 22 | Andrew Dabrowski, Lawrence S. Moss: The Johnson Graphs Satisfy a Distance Extension Property. Combinatorica 20(2): 295-300 (2000) | |
| 21 | Lawrence S. Moss: Exploring Logical Dynamics, Johan van Benthem. Journal of Logic, Language and Information 9(2): 261-263 (2000) | |
| 1999 | ||
| 20 | Lawrence S. Moss: Coalgebraic Logic. Ann. Pure Appl. Logic 96(1-3): 277-317 (1999) | |
| 19 | Lawrence S. Moss: Recursion and Corecursion Have the Same Equational Logic. Electr. Notes Theor. Comput. Sci. 20: 413-432 (1999) | |
| 1998 | ||
| 18 | Alexandru Batlag, Lawrence S. Moss, Slawomir Solecki: The Logic of Public Announcements and Common Knowledge and Private Suspicions. TARK 1998: 43-56 | |
| 17 | Antonius J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney: The Logic of Recursive Equations. J. Symb. Log. 63(2): 451-478 (1998) | |
| 1997 | ||
| 16 | Lawrence S. Moss, Norman Danner: On the Foundations of Corecursion. Logic Journal of the IGPL 5(2): 231-257 (1997) | |
| 1996 | ||
| 15 | Andrew Dabrowski, Lawrence S. Moss, Rohit Parikh: Topological Reasoning and the Logic of Knowledge. Ann. Pure Appl. Logic 78(1-3): 73-110 (1996) | |
| 1995 | ||
| 14 | Lawrence S. Moss: Power Set Recursion. Ann. Pure Appl. Logic 71(3): 247-306 (1995) | |
| 13 | Lawrence S. Moss, David E. Johnson: Dynamic Interpretations of Constraint-Based Grammar Formalisms. Journal of Logic, Language and Information 4(1): 61-79 (1995) | |
| 1993 | ||
| 12 | David E. Johnson, Adam Meyers, Lawrence S. Moss: A Unification-Based Parser for Relational Grammar. ACL 1993: 97-104 | |
| 11 | David E. Johnson, Lawrence S. Moss: Some Formal Properties of Stratified Feature Grammars. Ann. Math. Artif. Intell. 8(1-2): 133-173 (1993) | |
| 10 | Lawrence S. Moss, Satish R. Thatte: Modal Logic and Algebraic Specifications. Theor. Comput. Sci. 111(1&2): 191-210 (1993) | |
| 1992 | ||
| 9 | Lawrence S. Moss, Rohit Parikh: Topological Reasoning and The Logic of Knowledge. TARK 1992: 95-105 | |
| 8 | Lawrence S. Moss: Distanced graphs. Discrete Mathematics 102(3): 287-305 (1992) | |
| 7 | Lawrence S. Moss, José Meseguer, Joseph A. Goguen: Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability. Theor. Comput. Sci. 100(2): 267-302 (1992) | |
| 1991 | ||
| 6 | Michael W. Mislove, Lawrence S. Moss, Frank J. Oles: Non-Well-Founded Sets Modeled as Ideal Fixed Points Inf. Comput. 93(1): 16-54 (1991) | |
| 1989 | ||
| 5 | Yuri Gurevich, Lawrence S. Moss: Algebraic Operational Semantics and Occam. CSL 1989: 176-192 | |
| 4 | Michael W. Mislove, Lawrence S. Moss, Frank J. Oles: Non-Well-Founded Sets Obtained from Ideal Fixed Points LICS 1989: 263-272 | |
| 3 | Lawrence S. Moss, Satish R. Thatte: Generalization of Final Algebra Semantics by Relativization. Mathematical Foundations of Programming Semantics 1989: 284-300 | |
| 1988 | ||
| 2 | Lawrence S. Moss, Satish R. Thatte: Optimal semantics of data type extensions. Algebraic Logic and Universal Algebra in Computer Science 1988: 161-180 | |
| 1987 | ||
| 1 | Lawrence S. Moss, José Meseguer, Joseph A. Goguen: Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability. Category Theory and Computer Science 1987: 158-181 | |
| 1 | Jirí Adámek | [55] [58] |
| 2 | Alexandru Batlag | [18] |
| 3 | Andrew Dabrowski | [15] [22] |
| 4 | Norman Danner | [16] |
| 5 | Hans P. van Ditmarsch | [45] |
| 6 | J. Michael Dunn | [33] |
| 7 | Jörg Endrullis | [56] |
| 8 | Joseph A. Goguen | [1] [7] |
| 9 | Clemens Grabmayer | [56] |
| 10 | Yuri Gurevich | [5] |
| 11 | Tobias J. Hagge | [33] |
| 12 | Dimitri Hendriks | [56] |
| 13 | Antonius J. C. Hurkens | [17] |
| 14 | David E. Johnson | [11] [12] [13] |
| 15 | Jan Willem Klop | [56] |
| 16 | Monica McArthur | [17] |
| 17 | José Meseguer | [1] [7] |
| 18 | Adam Meyers | [12] |
| 19 | Stefan Milius | [34] [35] [42] [46] [52] [55] [58] |
| 20 | Joseph S. Miller | [30] |
| 21 | Michael W. Mislove | [4] [6] |
| 22 | Yiannis N. Moschovakis | [17] |
| 23 | Richard T. Oehrle | [24] |
| 24 | Frank J. Oles | [4] [6] |
| 25 | Rohit Parikh | [9] [15] [41] |
| 26 | Ian Pratt-Hartmann (Ian E. Pratt) | [44] |
| 27 | Daniel Schwencke | [52] |
| 28 | Slawomir Solecki | [18] |
| 29 | Lurdes Sousa | [55] [58] |
| 30 | Chris Steinsvold | [41] |
| 31 | Satish R. Thatte | [2] [3] [10] |
| 32 | Hans-Jörg Tiede | [28] |
| 33 | Ignacio Darío Viglizzo (Ignacio D. Viglizzo) | [29] [36] |
| 34 | Zhenghan Wang | [33] |
| 35 | Erik Wennstrom | [57] |
| 36 | Glen T. Whitney | [17] [57] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page