92 citations · 192 across the 19 of their papers we have counts for
22 papers
Fractals from Regular Behaviours
Todd Schmid, Victoria Noquez, Lawrence S. Moss
We forge connections between the theory of fractal sets obtained as attractors of iterated function systems and process calculi. To this end, we reinterpret Milner's expressions fo…
Terminal Coalgebras in Countably Many Steps
Jiří Adámek, Stefan Milius, Lawrence S. Moss
We present a collection of results that imply that an endofunctor on a category has a terminal coalgebra obtainable as a countable limit of its terminal-coalgebra chain. This holds…
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…
Presenting the Sierpinski Gasket in Various Categories of Metric Spaces
Jayampathy Ratnayake, Annanthakrishna Manokaran, Romaine Jayewardene +2
This paper studies presentations of the Sierpinski gasket as a final coalgebra for functors on several categories of metric spaces with additional designated points. The three cate…
The Sierpinski Carpet as a Final Coalgebra
Victoria Noquez, Lawrence S. Moss
We advance the program of connections between final coalgebras as sources of circularity in mathematics and fractal sets of real numbers. In particular, we are interested in the Si…