English
Related papers

Related papers: Uniform Elgot Iteration in Foundations

200 papers

Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…

Logic · Mathematics 2019-02-19 Michael Lieberman , Jiří Rosický , Sebastien Vasey

Derivations provide a way of transporting ideas from the calculus of manifolds to algebraic settings where there is no sensible notion of limit. In this paper, we consider derivations in certain monoidal categories, called codifferential…

Category Theory · Mathematics 2015-05-04 Richard Blute , Rory B. B. Lucyshyn-Wright , Keith O'Neill

Category Theory provides us with a clear notion of what is an internal structure. This will allow us to focus our attention on a certain type of relationship between context and structure.

Category Theory · Mathematics 2022-10-04 Dominique Bourn

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

Logic in Computer Science · Computer Science 2022-09-07 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…

Logic · Mathematics 2023-02-17 Saharon Shelah , Alexander Usvyatsov

An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…

Logic in Computer Science · Computer Science 2026-01-23 Thorsten Wißmann , Bálint Kocsis , Jurriaan Rot , Ruben Turkenburg

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

Logic in Computer Science · Computer Science 2022-05-27 Eric Finster , David Reutter , Alex Rice , Jamie Vicary

We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…

Logic in Computer Science · Computer Science 2022-04-11 Tom Hirschowitz , Ambroise Lafont

This paper describes a new technique, called "knowledge patterns", for helping construct axiom-rich, formal ontologies, based on identifying and explicitly representing recurring patterns of knowledge (theory schemata) in the ontology, and…

Artificial Intelligence · Computer Science 2020-05-12 Peter Clark , John Thompson , Bruce Porter

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Logic · Mathematics 2017-05-26 Luca Mauri

Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…

Logic in Computer Science · Computer Science 2007-05-23 André Hirschowitz , Marco Maggesi

We develop a notion of iterated monoidal category and show that this notion corresponds in a precise way to the notion of iterated loop space. Specifically the group completion of the nerve of such a category is an iterated loop space and…

Algebraic Topology · Mathematics 2007-05-23 C. Balteanu , Z. Fiedorowicz , R. Schwaenzl , R. Vogt

A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…

Category Theory · Mathematics 2020-06-22 Pau Enrique Moliner , Chris Heunen , Sean Tull

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

Logic in Computer Science · Computer Science 2026-05-14 Neta Elad , Sharon Shoham

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Rafał Stefański

The categorical compositional distributional model of natural language provides a conceptually motivated procedure to compute the meaning of sentences, given grammatical structure and the meanings of its words. This approach has…

Computation and Language · Computer Science 2016-01-26 Desislava Bankova , Bob Coecke , Martha Lewis , Daniel Marsden

Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…

Algebraic Topology · Mathematics 2020-12-03 Karthik Boyareddygari

Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the…

Artificial Intelligence · Computer Science 2025-05-20 Christian Antić

We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded…

Logic in Computer Science · Computer Science 2023-06-22 Sergey Goncharov , Lutz Schröder , Christoph Rauch , Julian Jakob

We present a categorical viewpoint of probability measures by showing that a probability measure can be viewed as a weakly averaging affine measurable functional taking values in the unit interval which preserves limits. The probability…

Category Theory · Mathematics 2015-03-18 Kirk Sturtz