For copyright reasons, some papers are posted in preprint form only.

Also, I'm slow in posting many of the papers. Feel free to write for preprints.


2013

2012


J. Adámek, P. B. Levy, S. Milius, L. Moss, and L. Sousa, On Final Coalgebras of Power-Set Functors and Saturated Trees, submitted, 2012.

Inference in a Boolean Fragment, in Thomas Graf, Denis Paperno, Anna Szabolcsi, and Jos Tellings (eds.), Theories of Everything: In Honor of Ed Keenan. UCLA Working Papers in Linguistics 17, 2012, 261-273.

T. Brauner, T. Bolander, S. Ghilardi, and L.S. Moss (Editors), Proceedings of the Ninth Conference on Advances in Modal Logic, College Publications, 2012, 592 pp.

J. Adámek, S. Milius, L. Moss, and L. Sousa, Well-Pointed Coalgebras, in L. Birkendal (ed.), Proc. Foundations of Software Science and Computation Structures (FoSSaCS 2012), LNCS 7213, 2012, 89-103.

The Soundness of Internalized Polarity Marking, Studia Logica 100:683-704, 2012.

L. Moss, E. Wennstrom, and G. Whitney, A Complete Logical System for the Equality of Recursive Terms for Sets, to appear in R. L. Constable and A. Silva (eds.), Logic and Program Semantics: Essays Dedicated to Dexter Kozen on the Occasion of his Sixtieth Birthday, LNCS 7230, 2012, pp. 180-203.

J. Adámek, S. Milius, and L. S. Moss, On Finitary Functors and Their Presentations, in D. Pattinson and L. Schröder (eds.) Proc. Coalgebraic Methods in Computer Science (CMCS 2012), LNCS 2012, 51–70.

J. Endrullis, C. Grabmayer, D. Hendricks, J. W. Klop, and L. S. Moss, Automatic Sequences and Zip-Specifications, in N. Dershowitz (ed.) Proc. Logic in Computer Science (LICS 2012), 335-344. Here is a preprint.

2011

Connections of Coalgebra and Semantic Modeling, in K. Apt (ed) Proc. Theoretical Aspects of Rationality and Knowledge (TARK 2011), 7 pp.

Syllogistic Logic with Comparative Adjectives, J. Logic, Language, and Information 20:3, 2011, special issue on papers from MoL 2007, 397-417.

J. Adámek, S. Milius, L. Moss, and L. Sousa, Power-Set Functors and Saturated Trees, in M. Bezem (ed.) Proc. Computer Science Logic 2011, 5-19.

The Role of Mathematical Methods, in D. G. Fara and G. Russell (eds.), Routledge Companion to the Philosophy of Language, Routledge, 2011, 533-543.

2010

Natural Logic and Semantics, in M. Aloni et al (eds.), Proceedings, 17th Amsterdam Colloquium, LNAI 6042, 2010, 84-93.

S. Milius, L. Moss, and D. Schwencke, CIA Structures and the Semantics of Recursion, in C.-H. L. Ong (ed.), Proc. Foundations of Software Science and Computation Structures (FoSSaCS 2010), LNCS 6014, 2010, 312-327. Here is a full version of this paper.

Logics for Two Fragments Beyond the Syllogistic Boundary, in Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, A. Blass, N. Dershowitz, and W. Reisig (eds.), LNCS, vol. 6300, Springer-Verlag, 2010, 538-563.

Syllogistic Logics with Verbs, Journal of Logic and Computation, special issue on papers from Order, Algebra and Logics, Vol. 20, No. 4, 2010, 947-967.

A Note on Expressive Coalgebraic Logics for Finitary Set Functors, in a special issue of the Journal of Logic and Computation, Vol. 20, No. 5, 2010, 1101-1111.

Syllogistic Logic with Complements, in J. van Benthem, A. Gupta, and E. Pacuit (eds.), Games, Norms and Reasons: Logic at the Crossroads, Springer Synthese Library Series, 2010, 185-203.

Intersecting Adjectives in Syllogistic Logic, in C. Ebert, G. Jaeger, and J. Michaelis, Proc. MoL 10/11, LNAI 6149, 2010, 223-237.

Interview on Epistemic Logic, in O. Roy and V. Hendricks (eds.) Epistemic Logic, 5 Questions, Automatic Press /VIP, 2010.

2009

S. Milius and L. Moss, Equational Properties of Recursive Program Scheme Solutions, Cahiers de Topologie et Géométrie Différentielle Catégoriques, (special volume of in Honour of J. Adámek on the Occasion of his Sixtieth Birthday), 50 (2009), 23-66.

G. Bezhanishvili and L. Moss, Undecidability of First-Order Logic, educational module for the NSF-sponsored project on Learning Discrete Mathematics and Computer Science via Primary Historical Sources, 26 pp, 2009.

I. Pratt-Hartmann and L. Moss, Logics for the Relational Syllogistic, Review of Symbolic Logic, Vol. 2, No. 4, 2009, 647-683. Here is a preprint of this paper.

2008

S. Milius and L. S. Moss, Corrigendum to paper below, Theoretical Computer Science, Volume 403 (2008), no. 2-3, 409-415.

Completeness Theorems for Syllogistic Fragments, in F. Hamm and S. Kepser (eds.) Logics for Linguistic Structures, Mouton de Gruyter, 2008, 143-173.

Confusion of Memory, Information Processing Letters, 107:3-4, 2008, 114-119.

A. Baltag and H. van Ditmarsch and L. S. Moss, Epistemic Logic and Information Update, in P. Adriaans and J. van Benthem (eds.), Handbook of the Philosophy of Information, Elsevier, 2008, 369--463.

Non-wellfounded Set Theory, in The Stanford Encyclopedia of Philosophy, Edward N. Zalta (ed.), article first published April 16, 2008.

2007

Finite Models Constructed From Canonical Formulas. Journal of Philosophical Logic, vol. 36, no. 6, 2007, 605-640.

L. S. Moss and H.-J.Tiede, Applications of Modal Logic in Linguistics, Chapter 19 of P. Blackburn, J. van Benthem, and F. Wolter (eds.), The Handbook of Modal Logic, Elsevier, 2007, 299-341.

R. Parikh, L. S. Moss, and C. Steinsvold, Topology and Epistemic Logic, Chapter 6 of M. Aiello, I. Pratt-Hartmann, and J. van Benthem (eds.), Handbook of Spatial Logics, Springer, 2007, 299-342.

2006

Applied Logic: A Manifesto, in D. Gabbay, S. Goncharov, and M. Zakharyaschev (eds.) Mathematical Problems from Applied Logics I: New Logics for the XXIst Century, Springer International Mathematical Series, 2006, 23 pp.

L. S. Moss and I. D. Viglizzo, Final Coalgebras for Measurable Spaces, Information and Computation, Volume 204, Issue 4 (April 2006) (special issue on selected papers from CMCS'04), 610-636.

Recursion Theorems and Self-Replication Via Text Register Machine Programs. Bulletin of the European Association for Theoretical Computer Science, Number 89, 2006, 171-182.

Uniform Functors on Sets, in K. Futatsugi et al. (eds.) Algebra, Meaning, and Computation: Festschrift in Honor of Prof. Joseph Goguen, Springer-Verlag LNCS 4064, 2006, 420-448.

S. Milius and L. S. Moss, The Category Theoretic Solution of Recursive Program Schemes. Theoretical Computer Science, Volume 366, Issues 1-2, November 2006, pp. 3-59, special issue on papers presented at CALCO'05. Preliminary version published in J. L. Fiadero et al (eds.) the Proc. CALCO'05 Springer LNCS 3629, 2005, 293-312. Here is a link to a revised version of this paper, following an important correction to the 2006 version.

2005

J. S. Miller and L. S. Moss, The Undecidability of Iterated Modal Relativization, Studia Logica, vol. 79, 373-407, 2005.

J. M. Dunn, T. J. Hagge, L. Moss, and Z. Wang, Quantum Logic as Motivated by Quantum Computing, Journal of Symbolic Logic vol. 70, no. 2, 353-359 (2005).

2004

L. S. Moss and I. D. Viglizzo, Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories, in J. Adámek and S. Milius (eds.), Proceedings 7th CMCS, ENTCS vol. 106, 279-295, 2004.

A. Baltag and L. S. Moss, Logics for Epistemic Programs, Synthese, Vol. 139, issue 2 (2004), 165-224.

2003

Recursion and Corecursion Have the Same Equational Logic, Theoretical Computer Science 294 (2003), no. 1-2, 233-267. Preliminary version in the Proc. of the 15th Meeting on Mathematical Foundations of Programming Semantics, ENTCS, Vol. 20, Elsevier, 1999.

2001

Parametric Corecursion, Theoretical Computer Science 260 (1-2), 2001, 139-163.

Simple Equational Specifications of Rational Arithmetic, Discrete Mathematics and Theoretical Computer Science, Volume 4, no. 2 (2001), 291-300.

2000

A. Dabrowski and L. S. Moss, The Johnson Graphs Satisfy a Distance Extension Property, Combinatorica, 20 (2), 2000, 295-300.

1999

From Hypersets to Kripke Models in Logics of Announcements. In JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, Vossiuspers, Amsterdam University Press, 1999.

Coalgebraic Logic, in Festschrift on the occasion of Professor Rohit Parikh's 60th birthday. Annals of Pure and Applied Logic 96 (1999), no. 1-3, 277-317. The last sections of this publication appear with lots of blank spaces due to a bug in the printing process, and they re-appear in the same journal: vol. 99 (1999) no. 1-3, 241-259.

1998

Jon Barwise and L. S. Moss, Modal Correspondence for Models, the Journal of Philosophical Logic, Vol. 27 (1998), 275-294. Preliminary version in P. Dekker et al (eds.) Proceedings of the Tenth Amsterdam Colloquium, 1996.

A. J. C. Hurkens, M. McArthur, Y. N. Moschovakis, L. S. Moss, and G. Whitney, The Logic of Recursion Equations, the J. Symbolic Logic, Vol. 63, No. 2 (1998), 451-478.

A. Baltag, L. S. Moss, and S. Solecki, The Logic of Common Knowledge, Public Announcements, and Private Suspicions, Proceedings of TARK-VII , 1998.

1997

N. Danner and L. S. Moss, On the Foundations of Corecursion, Logic Journal of the IGPL, Vol. 5, No. 2 (1997) (Special issue on papers from the 5th Workshop on Logic, Language, and Information), pp. 231-257.

1996

A. Dabrowski and R. Parikh, Topological Reasoning and the Logic of Knowledge. Annals of Pure and Applied Logic 78 (1996), no. 1-3, papers in honor of the Symposium on Logical Foundations of Computer Science, ``Logic at St. Petersburg'' (St. Petersburg, 1994), 73-110.

J. Seligman and L. S. Moss, Situation Theory, Chapter 4 of J. van Benthem and A. ter Meulen (eds.), Handbook of Logic and Language, Kluwer, 1996, pp. 239-309.


J. Barwise and L. S. Moss, Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena, CSLI Lecture Notes Number 60, CSLI Publications, Stanford University, 1996.


1995

D. E. Johnson and L. S. Moss, Generalizing Feature Structures for Multistratal Relational Analyses. In J. Cole, et al (eds.), Linguistics and Computation, CSLI Lecture Notes Number 52, CSLI Publications, 1995, 29-84.

D. E. Johnson and L. S. Moss, Evolving Algebras and Mathematical Models of Language. In M. Masuch and L. Polos (eds.), Applied Logic: How, What, and Why, Kluwer, 1995, pp. 143-176.

D. E. Johnson and L. S. Moss, Grammar Formalisms Viewed as Evolving Algebras. In Linguistics and Philosophy, special issue on selected papers from MOL4, vol. 17, 1995, pp. 537-560.

D. E. Johnson and L. S. Moss, A Dynamic View of Constraint-Based Formalisms. Journal of Logic, Language, and Information, special issue on Static and Dynamic Aspects of Syntactic Structures, vol. 4, no. 1, 1995, pp. 61-79.

Power Set Recursion. Annals of Pure and Applied Logic, 71 (1995), pp. 247-306.

1994

D. E. Johnson and L. S. Moss, An Overview of Stratified Feature Grammar. In C. Martin-Vide (ed.), Current Issues in Mathematical Linguistics, Elsevier, Amsterdam, 1994, 103-199.

J. M. Seligman and L. S. Moss, Classification Domains and Information Links: Theory and Applications. In J. van Eijck and A. Visser (eds.), Logic and the Flow of Information, Kluwer Academic Publishers, Studies in Logic, Language and Information, 1994, 112-124.

1993

L. S. Moss and S. R. Thatte, Modal Logic and Algebraic Specifications. Theoretical Computer Science 111, No. 1-2, (1993), pp. 191-210.

D. E. Johnson and L. S. Moss, Some Formal Properties of Stratified Feature Grammars. Annals of Artificial Intelligence and Mathematics, vol. 8, 1993, pp. 133-173.

D. E. Johnson, A. Meyers, and L. S. Moss, Parsing With Relational Grammar. Proc., 31st Annual Meeting of the Assoc. for Computational Linguistics, 1993, pp. 97-104.

1992

L. S. Moss, J. Meseguer, and J. A. Goguen, Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability. Theoretical Computer Science 100 (1992), 267-302. It also appears in D.H. Pitt, et al (eds.), Conference on Category Theory and Computer Science, Springer LNCS 283, 1987, pp. 158-181.

Distanced Graphs. Discrete Mathematics 102, No. 3 (1992), pp. 287-305.

L. S. Moss and R. Parikh, Topological Reasoning and the Logic of Knowledge (Preliminary Report), in Y. Moses (ed.), Proceedings of TARK IV, Morgan Kaufmann, 1992.

1991

Completeness Theorems for Logics of Feature Structures. In Y. N. Moschovakis (ed.), Logic From Computer Science, MSRI Pubs. Vol. 21, Springer-Verlag, 1991, pp. 387-403.

J. Barwise and L. Moss, Hypersets. The Mathematical Intelligencer, 13, No. 4 (1991), 31-41.

The Universal Graphs of Fixed Finite Diameter. In Y. Allavi, et al (eds.), Graph Theory, Combinatorics, and Applications, Volume 2, John Wiley and Sons, 1991, 923-937.

1990

Y. Gurevich and L. S. Moss, The Operational Algebraic Semantics of Occam. In E. Börger, et al (eds.), Proceedings of the Second Computer Science Logic Symposium, Springer LNCS vol. 440, 1990, pp. 176-192.

Existence and Nonexistence of Universal Graphs. Fundamenta Mathematicae 133 (1990), pp. 129-141.

L. S. Moss and S. R. Thatte, Generalization of Final Algebra Semantics by Relativization. In M. Main, et al (eds.), Proceedings, Mathematical Foundations of Programming Semantics, Springer LNCS 422, 1990, pp. 284-300.

L. S. Moss and S. R. Thatte, Optimal Semantics of Data Type Extensions. In C. Bergman, et al (eds.), Proceedings, Algebraic Logic and Universal Algebra in Computer Science, Springer LNCS 425, 1990, pp. 161-180.

M. W. Mislove, L. S. Moss, and F. J. Oles, Partial Sets. In R. Cooper, et al (eds.) Situation Theory and Its Applications, vol. 1, CSLI Lecture Notes 22, 1990, pp. 117-131.

1985

E. L. Keenan and L. S. Moss, Generalized Quantifiers and the Expressive Power of Natural Language. Chapter 4 of J. van Benthem, and A. ter Meulen (eds.), Generalized Quantifiers in Natural Language, Groningen-Amsterdam Series in Semantics No. 4, Foris, 1985, pp. 73-124.

1984

E. L. Keenan and L. S. Moss, Generalized Quantifiers and the Logical Expressive Power of Natural Language. In M. Cobler, et al (eds.), Third West Coast Conference on Formal Linguistics, Stanford Linguistics Association, 1984, pp. 149-157.