Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
The Logic of Public Announcements and Common Knowledge and Private Suspicions
This paper presents a logical system in which various group-level epistemic actions are incorporated into the object language and contains the infinitary operators used in the standard modeling of common knowledge. Expand
Logics for Epistemic Programs
The construction of 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 by defining a notion of epistemic program, which is a Kripke model of ‘actions’, representing the agents' uncertainty about the current action in a similar way that Kripkel models are commonly used in epistemic logic. Expand
Topological Reasoning and the Logic of Knowledge
A deeper answer is needed that areas of mathematics can be seen as repositories for the authors' intuitions about several aspects of ordinary life. Expand
- L. Moss
- Computer Science
- Ann. Pure Appl. Log.
A generalization of modal logic to logical systems which are interpreted on coalgebras of functors on sets and finds that the formulas of coalgebraic logics can be viewed as approximations to the elements of the nal coalgebra. Expand
Vicious circles - on the mathematics of non-wellfounded phenomena
Part I. Circularity and the notion of set, modeling partial information, and Conclusions and future directions. Expand
Probing Natural Language Inference Models through Semantic Fragments
This work proposes the use of semantic fragments---systematically generated datasets that each target a different semantic phenomenon---for probing, and efficiently improving, such capabilities of linguistic models. Expand
- L. Moss
- Computer Science, Mathematics
- Theor. Comput. Sci.
- 6 June 2001
The substitution results are coalgebraic versions of well-known consequences of initiality, and the work on corecursion is a general formulation which allows one to specify elements of nal coalgebras using systems of equations. Expand
Logics for epistemic programs
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… Expand
FINITE MODELS CONSTRUCTED FROM CANONICAL FORMULAS
- L. Moss
- Mathematics, Computer Science
- J. Philos. Log.
- 29 June 2007
This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves and develops a general model-construction method based on this definition. Expand