23 citations · 35 across the 6 of their papers we have counts for
3 papers · 1 filter
Logics for Epistemic Actions: Completeness, Decidability, Expressivity
Alexandru Baltag, Lawrence S. Moss, Slawomir Solecki
We consider dynamic versions of epistemic logic as formulated in Baltag and Moss "Logics for epistemic programs" (2004). That paper proposed a logical language (actually families o…
A Completeness Result for Inequational Reasoning in a Full Higher-Order Setting
Lawrence S. Moss, Thomas F. Icard
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures…
On Well-Founded and Recursive Coalgebras
Jiří Adámek, Stefan Milius, Lawrence S. Moss
This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive…