English
Related papers

Related papers: Internal languages of locally cartesian closed $(\…

200 papers

We study locally compact contractive local groups, that is, locally compact local groups with a contractive pseudo-automorphism. We prove that if such an object is locally connected, then it is locally isomorphic to a Lie group. We also…

Differential Geometry · Mathematics 2009-10-08 Lou van den Dries , Isaac Goldbring

We consider three (2-)categories and their (anti-)equivalence. They are the category of small abelian categories and exact functors, the category of definable additive categories and interpretation functors, the category of locally coherent…

Category Theory · Mathematics 2012-02-03 Mike Prest

Refinement types are types equipped with predicates that specify preconditions and postconditions of underlying functional languages. We propose a general semantic construction of dependent refinement type systems from underlying type…

Logic in Computer Science · Computer Science 2020-10-19 Satoshi Kura

We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…

Formal Languages and Automata Theory · Computer Science 2017-02-17 Janusz A. Brzozowski

The term Stone-type duality often refers to a dual equivalence between a category of lattices or other partially ordered structures on one side and a category of topological structures on the other. This paper is part of a larger endeavour…

Category Theory · Mathematics 2020-09-07 Dirk Hofmann , Pedro Nora

For a closed locally symmetric space M=\Gamma\G/K and a representation of G we consider the push-forward of the fundamental class in the homology of the linear group and a related invariant in algebraic K-theory. We discuss the…

Geometric Topology · Mathematics 2014-10-01 Thilo Kuessner

This is a review/announcement of results concerning the connection between certain exactly solvable two-dimensional models of statistical mechanics, namely loop models, and the equivariant $K$-theory of the cotangent bundle of the…

Algebraic Geometry · Mathematics 2018-07-16 Paul Zinn-Justin

We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are…

Logic in Computer Science · Computer Science 2021-05-21 Amaldev Manuel , Dhruv Nevatia

We introduce and study a purely syntactic notion of lax cones and $(\infty,\infty)$-limits on finite computads in \texttt{CaTT}, a type theory for $(\infty,\infty)$-categories due to Finster and Mimram. Conveniently, finite computads are…

Category Theory · Mathematics 2025-12-01 Thomas Jan Mikhail

We give structural results about bifibrations of (internal) $(\infty,1)$-categories with internal sums. This includes a higher version of Moens' Theorem, characterizing cartesian bifibrations with extensive aka stable and disjoint internal…

Category Theory · Mathematics 2024-03-12 Jonathan Weinberger

Tree-controlled grammars are context-free grammars where the derivation process is controlled in such a way that every word on a level of the derivation tree must belong to a certain control language. We investigate the generative capacity…

Computational Complexity · Computer Science 2023-09-07 Bianca Truthe

We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Paolo Capriotti , Régis Spadotti

We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire by Paykin et al., we consider both a simple first-order…

Logic in Computer Science · Computer Science 2023-06-22 Mathys Rennela , Sam Staton

Mazurkiewicz traces describe concurrent behaviors of distributed systems. Trace-closed word languages, which are "linearizations" of trace languages, constitute a weaker notion of concurrency but still give us tools to investigate the…

Formal Languages and Automata Theory · Computer Science 2014-02-14 Namit Chaturvedi , Marcus Gelderie

Let $G$ be a $p$-adic Lie group with reductive Lie algebra $\mathfrak{g}$. In analogy to the translation functors introduced by Bernstein and Gelfand on categories of $U(\mathfrak{g})$-modules we consider similarly defined functors on the…

Representation Theory · Mathematics 2022-11-16 Akash Jena , Aranya Lahiri , Matthias Strauch

Let $[0,1]_*$ be the unit interval $[0,1]$ equipped with a continuous t-norm $*$. It is shown that the category of $[0,1]_*$-sets is cartesian closed if, and only if, $*$ is the minimum t-norm on $[0,1]$.

Category Theory · Mathematics 2026-01-21 Lili Shen , Jian Zhang

We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of…

Formal Languages and Automata Theory · Computer Science 2022-07-04 Matthew Earnshaw , Paweł Sobociński

Riehl and Verity have established that for a quasi-category $A$ that admits limits, and a homotopy coherent monad on $A$ which does not preserve limits, the Eilenberg-Moore object still admits limits; this can be interpreted as a…

Category Theory · Mathematics 2025-05-22 Joanna Ko

By a local geometric Langlands correspondence for a complex reductive group G we understand a construction which assigns to a local system on the punctured disc for the Langlands dual group of G, a category equipped with an action of the…

Representation Theory · Mathematics 2007-05-23 Edward Frenkel , Dennis Gaitsgory

A regular tree language L is locally testable if membership of a tree in L depends only on the presence or absence of some fix set of neighborhoods in the tree. In this paper we show that it is decidable whether a regular tree language is…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Thomas Place , Luc Segoufin