English
Related papers

Related papers: Sketches and Classifying Logoi

200 papers

We argue that locally Cartesian closed categories form a suitable doctrine for defining dependent type theories, including non-extensional ones. Using the theory of sketches, one may define syntactic categories for type theories in a style…

Logic in Computer Science · Computer Science 2021-03-11 Daniel Gratzer , Jonathan Sterling

Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…

Logic · Mathematics 2011-03-29 Maria Ernestina Chavez Rodriguez , Zbigniew Oziewicz

Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…

Artificial Intelligence · Computer Science 2023-03-10 Marc Aiguier , Isabelle Bloch , Salim Nibouche , Ramon Pino Perez

We define a notion of symmetric monoidal closed (SMC) theory, consisting of a SMC signature augmented with equations, and describe the classifying categories of such theories in terms of proof nets.

Logic in Computer Science · Computer Science 2009-06-08 Richard Garner , Tom Hirschowitz , Aurélien Pardon

We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary. We define the…

Logic in Computer Science · Computer Science 2023-06-22 Ramanathan S. Thinniyam

In this work we develop a theory of motives for logarithmic schemes over fields in the sense of Fontaine, Illusie, and Kato. Our construction is based on the notion of finite log correspondences, the dividing Nisnevich topology on log…

Algebraic Geometry · Mathematics 2021-09-24 Federico Binda , Doosung Park , Paul Arne Østvær

In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…

Combinatorics · Mathematics 2021-04-23 Jaroslav Nesetril , Patrice Ossona De Mendez

In 20th century mathematics, the field of topology, which concerns the properties of geometric objects under continuous transformation, has proved surprisingly useful in application to the study of discrete mathematics, such as…

History and Overview · Mathematics 2024-05-10 Jingsi Hou , Guangyan Huang , Sammy Suliman , Haoran Yan

We develop a graphical calculus of manifold diagrams which generalises string and surface diagrams to arbitrary dimensions. Manifold diagrams are pasting diagrams for $(\infty, n)$-categories that admit a semi-strict composition operation…

Algebraic Topology · Mathematics 2024-11-08 Lukas Heidemann

The logic of definitions is a family of logics for encoding and reasoning about judgments, which are atomic predicates specified by inference rules. A definition associates an atomic predicate with a logical formula, which may itself depend…

Logic in Computer Science · Computer Science 2026-02-04 Nathan Guermond

The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…

General Topology · Mathematics 2018-04-13 Wanjun Hu

Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-23 Antonio Cruciani , Avinandan Das , Alesya Raevskaya , Jukka Suomela

In this paper, we provide an upgrade of Deligne's geometric class field theory for tamely ramified Galois groups using logarithmic geometry. In particular, we define a framed logarithmic Picard space, and show that a logarithmic…

Algebraic Geometry · Mathematics 2025-08-13 Aaron Slipper

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

Computational Geometry · Computer Science 2017-09-06 Éric Colin de Verdière

Cube categories are used to encode higher-dimensional categorical structures. They have recently gained significant attention in the community of homotopy type theory and univalent foundations, where types carry the structure of such higher…

Logic in Computer Science · Computer Science 2020-07-21 Gun Pinyo , Nicolai Kraus

A groupoid is a small category in which each morphism has an inverse. A topological groupoid is a groupoid in which both sets of objects and morphisms have topologies such that all groupoid structure maps are continuous. The notion of…

Differential Geometry · Mathematics 2007-05-23 Osman Mucuk , Ilhan Icen

We develop a formalism that allows us to describe Markov compacta with finite sets of diagrams that are building blocks of the entire sequence. This encodes complex, continuous spaces with discrete collections of combinatorial objects. We…

Geometric Topology · Mathematics 2017-11-23 G. C. Bell , A. Nagórko

This paper investigates the derived and spectral analogs of logarithmic geometry. We develop the deformation theory for animated log rings and $\mathbb{E}_\infty$-log rings and examine the corresponding theories of derived and spectral log…

Algebraic Geometry · Mathematics 2026-01-22 Ruichuan Zhang

A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational…

High Energy Physics - Theory · Physics 2015-06-16 Dmitri V. Fursaev , Alexander Patrushev , Sergey N. Solodukhin

In a labeling scheme the vertices of a given graph from a particular class are assigned short labels such that adjacency can be algorithmically determined from these labels. A representation of a graph from that class is given by the set of…

Computational Complexity · Computer Science 2018-02-09 Maurice Chandoo