English
Related papers

Related papers: Types, Codes and TFTs

200 papers

We study a special sort of 2-dimensional extended Topological Quantum Field Theories (TQFTs) which we call open-closed TQFTs. These are defined on open-closed cobordisms by which we mean smooth compact oriented 2-manifolds with corners that…

Algebraic Topology · Mathematics 2008-02-22 Aaron D. Lauda , Hendryk Pfeiffer

Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its semantics is parameterized with respect to a semiring on which the values that weighted…

Logic in Computer Science · Computer Science 2021-04-30 Antonis Achilleos , Mathias Ruggaard Pedersen

We investigate relative versions of dualizability designed for relative versions of topological field theories (TFTs), also called twisted TFTs, or quiche TFTs in the context of symmetries. In even dimensions we show an equivalence between…

Category Theory · Mathematics 2025-03-27 Claudia Scheimbauer , Thomas Stempfhuber

In this paper we propose a naive construction of 2-dimensional extended topological quantum field theories (TQFTs), which can be further generalized to the higher-dimension extended TQFTs.

Quantum Algebra · Mathematics 2007-05-23 Vishvajit V. S. Gautam

This lecture series is based on joint work in progress with Shaul Barkan, as well as work in progress of the author. The five sections of these notes correspond to the five lectures, but more details have been added. $2$-dimensional…

Category Theory · Mathematics 2025-06-30 Jan Steinebrunner

It has been common wisdom among mathematicians that Extended Topological Field Theory in dimensions higher than two is naturally formulated in terms of n-categories with n> 1. Recently the physical meaning of these higher categorical…

Quantum Algebra · Mathematics 2010-04-23 Anton Kapustin

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

One of the main reasons for the correspondence of regular languages and monadic second-order logic is that the class of regular languages is closed under images of surjective letter-to-letter homomorphisms. This closure property holds for…

Logic in Computer Science · Computer Science 2022-01-26 Mikołaj Bojańczyk , Bartek Klin , Julian Salamanca

Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…

Logic · Mathematics 2021-05-27 Deacon Linkhorn

The notion of 2-framed three-manifolds is defined. The category of 2-framed cobordisms is described, and used to define a 2-framed three-dimensional TQFT. Using skeletonization and special features of this category, a small set of data and…

Quantum Algebra · Mathematics 2007-05-23 Stephen Sawin

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…

Logic in Computer Science · Computer Science 2015-07-01 Achim Blumensath , Bruno Courcelle

We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…

Logic · Mathematics 2022-03-14 Deacon Linkhorn

Within the framework of relative and absolute quantum field theories (QFTs), we present a general formalism for understanding polarizations of the intermediate defect group and constructing non-invertible duality defects in theories in $2k$…

High Energy Physics - Theory · Physics 2023-06-22 Craig Lawrie , Xingyang Yu , Hao Y. Zhang

A proposal of the concept of $n$-regular obstructed categories is given. The corresponding regularity conditions for mappings, morphisms and related structures in categories are considered. An n-regular TQFT is introduced. It is shown the…

Quantum Algebra · Mathematics 2009-11-07 Steven Duplij , Wladyslaw Marcinek

We study the problem of fitting ontologies and constraints to positive and negative examples that take the form of a finite relational structure. As ontology and constraint languages, we consider the description logics $\mathcal{E\mkern-2mu…

Artificial Intelligence · Computer Science 2025-08-20 Simon Hosemann , Jean Christoph Jung , Carsten Lutz , Sebastian Rudolph

Topological quantum field theories (TQFTs) are symmetric monoidal functors out of cobordism categories. In dimension two, oriented TQFTs are famously classified by commutative Frobenius algebras. In the unoriented setting, the…

Quantum Algebra · Mathematics 2025-12-11 Leon J. Goertz , Paul Wedrich

We study logics defined in terms of second-order monadic monoidal and groupoidal quantifiers. These are generalized quantifiers defined by monoid and groupoid word-problems, equivalently, by regular and context-free languages. We give a…

Logic in Computer Science · Computer Science 2015-07-01 Juha Kontinen , Heribert Vollmer

We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…

Computation and Language · Computer Science 2011-02-28 Victor Gluzberg

We investigate invertible projective representations and their 2-categorical analogues using the language of TQFTs with defects. The main result is a freeness property for invertible projective representatios. While trivial in the…

Category Theory · Mathematics 2025-09-23 Domenico Fiorenza , Chetan Vuppulury

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser
‹ Prev 1 2 3 10 Next ›