Related papers: Types, Codes and TFTs
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…
Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…
In this paper we survey some surprising connections between group theory, the theory of automata and formal languages, the theory of ends, infinite games of perfect information, and monadic second-order logic.
We present a general framework for TQFT and related constructions using the language of monoidal categories. We construct a topological category C and an algebraic category D, both monoidal, and a TQFT functor is then defined as a certain…
We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…
Much of the current research and development in the field of automated reasoning builds on the infrastructure provided by the TPTP World. The TPTP language for logical formulae is central to the far-reaching adoption of the TPTP World. This…
Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…
The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group…
We consider coupling an ordinary quantum field theory with an infinite number of degrees of freedom to a topological field theory. On R^d the new theory differs from the original one by the spectrum of operators. Sometimes the local…
We give a finite presentation of the cobordism symmetric monoidal bicategory of (smooth, oriented) closed manifolds, cobordisms and cobordisms with corners as an extension of the bicategory of closed manifolds, cobordisms and…
These notes offer an introduction to the functorial and algebraic description of 2-dimensional topological quantum field theories `with defects', assuming only superficial familiarity with closed TQFTs in terms of commutative Frobenius…
We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…
We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious logic equivalences into positive first-order logic: FO+ is equivalent to LTL+ ,…
We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental…
We give an overview over several constructions of TQFT's over finite fields and cyclotomic integers and their applications to characterizing 3-manifolds and their fundamental groups.
For p>3 a prime, and g>2 an integer, we use Topological Quantum Field Theory (TQFT) to study a family of p-1 highest weight modules L_p(lambda) for the symplectic group Sp(2g,K) where K is an algebraically closed field of characteristic p.…
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…
We extend the TFT construction of CFT correlators of [arXiv:hep-th/0204148] to so-called finite logarithmic CFTs for which the algebraic input data is no longer semisimple but still finite. More specifically, starting from the data of a…
A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…
In his PhD thesis, Goosen combined the string-net and the generators-and-relations formalisms for arbitrary once-extended 3-dimensional TQFTs. In this paper we work this out in detail for the simplest non-trivial example, where the…