Lawrence S. Moss
Computer Science · Indiana University
Publications
181
Citations
3,740
Est. group size
—
Recurring co-author estimate
Active years
49
Publishing since 1978
Lawrence S. Moss works at the intersection of mathematical logic and computer science, studying how formal reasoning systems can capture the meaning of language and mathematical concepts. His work spans natural language inference (teaching computers to judge whether one statement follows from another), the algebra behind self-referential and recursive structures, and logical models of learning and knowledge. Recent projects also connect these formal tools to large language models and to visualizing mathematical dependencies.
Publication activity has been fairly steady over the past decade, averaging around five to six papers per year with some year-to-year variation.
Generated by claude-opus-4-8 from public bibliographic data · Jul 9, 2026
No award with a current end date on record.
2 earlier awards
- NSF 1156515Jun 2012 – May 2015 · $266k awarded
REU Site: Research Experiences for Undergraduates in Mathematics in Indiana University
- NSF 1019206Jun 2010 – Sep 2013 · $45k awarded
North American Summer School in Logic, Language and Information (NASSLLI) at Indiana University
Matched to public NIH RePORTER and NSF records by name and institution. Awards from other agencies are not shown, and a match is not always found — this list may be incomplete.
Typically publishes in teams of ~3 · 74% small-team papers (≤3 authors) · across 25 venues
- Bridging the gap between natural logics and description logics
Journal of Applied Non-Classical Logics · 2026
- Initial Algebras and Terminal Coalgebras
Cambridge University Press eBooks · 2025
- Fractals from Regular Behaviours
Logical Methods in Computer Science · 2025
- Math Natural Language Inference: this should be easy!
arXiv (Cornell University) · 2025
- Math Natural Language Inference: this should be easy!
2025
- KnowTeX: Visualizing Mathematical Dependencies
arXiv (Cornell University) · 2025
- KnowTeX: Visualizing Mathematical Dependencies
arXiv (Cornell University) · 2025
- What Do Hebbian Learners Learn? Reduction Axioms for Iterated Hebbian Learning
Proceedings of the AAAI Conference on Artificial Intelligence · 2024
- Presenting the Sierpinski Gasket in Various Categories of Metric Spaces
Applied Categorical Structures · 2024
- Extracting Mathematical Concepts with Large Language Models
arXiv (Cornell University) · 2023
- Logics for Epistemic Actions: Completeness, Decidability, Expressivity
Logics · 2023
- On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls)
arXiv (Cornell University) · 2023
- Fractals from Regular Behaviours
arXiv (Cornell University) · 2023
- Algebra of Self-Replication
arXiv (Cornell University) · 2023
- Algebra of Self-Replication
Electronic Notes in Theoretical Informatics and Computer Science · 2023
- arXiv (Cornell University)×17
- Proceedings of the AAAI Conference on Artificial Intelligence×3
- Lecture notes in computer science×3
- Electronic Proceedings in Theoretical Computer Science×3
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)×2
- J. Michael Dunn
Computer Science · Indiana University
- Richmond H. Thomason
Computer Science · University of Michigan
- Charles McCarty
Computer Science · Indiana University
- Yuri Gurevich
Computer Science · University of Michigan
- Esfandiar Haghverdi
Computer Science · Indiana University
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Sep 1, 2026.
Claim or correct this profile