## 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.

## J. M. Dunn, L. S. Moss, and Z. Wang, The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing,

## Three Etudes on Logical Dynamics and the Program of Natural Logic, to appear in A. Baltag and S. Smets (eds.),

## T. Icard, III and L. Moss, Recent Progress on Monotonicity, to appear in

## 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.