English
Related papers

Related papers: Cobordisms and commutative categorial grammars

200 papers

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, where grades of acceptability are assigned to arguments.…

Artificial Intelligence · Computer Science 2023-08-01 Jesse Heyninck , Badran Raddaoui , Christian Straßer

This paper discusses the cobordism of Lagrangian submanifolds (in the monotone setting) and structures it as a category that is related in a functorial way to an appropriate (derived) Fukaya category. Are also discussed obstructions to…

Symplectic Geometry · Mathematics 2015-03-19 Paul Biran , Octav Cornea

We define a cobordism theory in algebraic geometry based on normal crossing degenerations with double point singularities. The main result is the equivalence of double point cobordism to the theory of algebraic cobordism previously defined…

Algebraic Geometry · Mathematics 2007-05-23 M. Levine , R. Pandharipande

Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This…

Logic · Mathematics 2010-10-05 K. Dosen , Z. Petric

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

In this work, we leverage the linear algebraic structure of distributed word representations to automatically extend knowledge bases and allow a machine to learn new facts about the world. Our goal is to extract structured facts from…

Computation and Language · Computer Science 2015-11-24 Lisa Seung-Yeon Lee

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

Category Theory · Mathematics 2016-03-04 Darllan Conceição Pinto , Hugo Luiz Mariano

We construct higher categories of iterated spans, possibly equipped with extra structure in the form of "local systems", and classify their fully dualizable objects. By the Cobordism Hypothesis, these give rise to framed topological quantum…

Algebraic Topology · Mathematics 2018-11-30 Rune Haugseng

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

Logic · Mathematics 2021-12-09 Rob Egrot

We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from…

Logic in Computer Science · Computer Science 2011-02-15 Sandra Alves , Maribel Fernández , Ian Mackie

We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…

Logic in Computer Science · Computer Science 2010-03-24 Ph. Balbiani , R. Echahed , A. Herzig

We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…

Logic in Computer Science · Computer Science 2010-07-23 Lucas Dixon , Ross Duncan , Aleks Kissinger

We consider Legendrian links and tangles in $J^1S^1$ and $J^1[0,1]$ equipped with Morse complex families over a field $\mathbb{F}$ and classify them up to Legendrian cobordism. When the coefficient field is $\mathbb{F}_2$ this provides a…

Symplectic Geometry · Mathematics 2021-11-24 Yu Pan , Dan Rutherford

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

Logic · Mathematics 2025-12-17 Álvaro Díaz Ramos , Garrett Ervin , Saharon Shelah

In this paper, we discuss a method for identifying a seed word that would best represent a class of named entities in a graphical representation of words and their similarities. Word networks, or word graphs, are representations of…

Computation and Language · Computer Science 2018-07-13 Miguel Feria , Juan Paolo Balbin , Francis Michael Bautista

Together with F. Morel, we have constructed in \cite{CR, Cobord1, Cobord2} a theory of {\em algebraic cobordism}, an algebro-geometric version of the topological theory of complex cobordism. In this paper, we give a survey of the…

K-Theory and Homology · Mathematics 2007-05-23 Marc Levine

Let P be a connected smooth p-manifold. We describe the group of all cobordism classes of smooth maps of n-manifolds to P with singularities of a given $cal K$-invariant class in terms of certain stable homotopy groups by applying the…

Geometric Topology · Mathematics 2008-05-14 Yoshifumi Ando

We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…

Logic in Computer Science · Computer Science 2017-01-19 Lawrence Dunn , Jamie Vicary