Zobrazeno 1 - 10
of 273
pro vyhledávání: '"MOSS, LAWRENCE"'
Autor:
Moss, Lawrence S.
Publikováno v:
Electronic Notes in Theoretical Informatics and Computer Science, Volume 3 - Proceedings of MFPS XXXIX (November 23, 2023) entics:12320
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and computabili
Externí odkaz:
http://arxiv.org/abs/2309.09931
We extract mathematical concepts from mathematical text using generative large language models (LLMs) like ChatGPT, contributing to the field of automatic term extraction (ATE) and mathematical text processing, and also to the study of LLMs themselve
Externí odkaz:
http://arxiv.org/abs/2309.00642
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 for processes as contraction operators on a complete metric space. When
Externí odkaz:
http://arxiv.org/abs/2306.03894
The Vietoris space of compact subsets of a given Hausdorff space yields an endofunctor $\mathscr V$ on the category of Hausdorff spaces. Vietoris polynomial endofunctors on that category are built from $\mathscr V$, the identity and constant functors
Externí odkaz:
http://arxiv.org/abs/2303.11071
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 of languages parameterized by action signatures) for dynamic epistemic
Externí odkaz:
http://arxiv.org/abs/2203.06744
Autor:
Moss, Lawrence S., Icard, Thomas F.
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, the full type hierarchies over preorders for the base types. The syn
Externí odkaz:
http://arxiv.org/abs/2202.08725
Autor:
Ratnayake, Jayampathy, Manokaran, Annanthakrishna, Jayewardene, Romaine, Noquez, Victoria, Moss, Lawrence S.
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 categories which we study differ on their morphisms: one uses short (non-e
Externí odkaz:
http://arxiv.org/abs/2110.06916
Autor:
Noquez, Victoria, Moss, Lawrence S.
Publikováno v:
EPTCS 372, 2022, pp. 249-261
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 Sierpinski carpet, taking it as a fractal subset of the unit square. We
Externí odkaz:
http://arxiv.org/abs/2110.06404
Deep learning (DL) based language models achieve high performance on various benchmarks for Natural Language Inference (NLI). And at this time, symbolic approaches to NLI are receiving less attention. Both approaches (symbolic and DL) have their adva
Externí odkaz:
http://arxiv.org/abs/2105.14167