Related papers: Types, Codes and TFTs
The class of Basic Feasible Functionals BFF$_2$ is the type-2 counterpart of the class FP of type-1 functions computable in polynomial time. Several characterizations have been suggested in the literature, but none of these present a…
Answer set programming - the most popular problem solving paradigm based on logic programs - has been recently extended to support uninterpreted function symbols. All of these approaches have some limitation. In this paper we propose a…
We formulate a family of spin Topological Quantum Filed Theories (spin-TQFTs) as fermionic generalization of bosonic Dijkgraaf-Witten TQFTs. They are obtained by gauging $G$-equivariant invertible spin-TQFTs, or, in physics language,…
Divisible residuated lattices are algebraic structures corresponding to a more comprehensive logic than Hajek's basic logic with an important significance in the study of fuzzy logic. The purpose of this paper is to investigate commutative…
This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one…
We provide a non-technical overview of recent extensions of renormalization methods and techniques to Group Field Theories (GFTs), a class of combinatorially non-local quantum field theories which generalize matrix models to dimension $d…
We propose to use Church encodings in typed lambda-calculi as the basis for an automata-theoretic counterpart of implicit computational complexity, in the same way that monadic second-order logic provides a counterpart to descriptive…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
We consider extensions of monadic second order logic over $\omega$-words, which are obtained by adding one language that is not $\omega$-regular. We show that if the added language $L$ has a neutral letter, then the resulting logic is…
Given two two-dimensional conformal field theories, a domain wall -- or defect line -- between them is called invertible if there is another defect with which it fuses to the identity defect. A defect is called topological if it is…
We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…
This thesis embarks on a comprehensive exploration of formal computational models that underlie typed programming languages. We focus on programming calculi, both functional (sequential) and concurrent, as they provide a compelling rigorous…
Language models lack the notion of interchangeable tokens: symbols that are semantically equivalent yet distinct, such as bound variables in formal logic. This limitation prevents generalization to larger vocabularies and hinders the…
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit characterizations of BFF based on a typed programming language of…
We study a simple, self-dual, rational, and $C_2$-cofinite vertex operator algebra of CFT-type whose simple current modules are graded by $\mathbb{Z}_{2k}$. Based on those simple current modules, a vertex operator algebra associated with a…
This thesis contains various results on unitary 2-representations of finite groups and their 2-characters, as well as on pivotal structures for fusion categories. The motivation is extended topological quantum field theory (TQFT), where the…
A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…
We extend results from an earlier paper giving reconstruction results for the endomorphism monoid of the rational numbers under the strict and reflexive relations to the first order reducts of the rationals and the corresponding…
The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining…
We argue that in some KR applications, we want to quantify over sets of concepts formally represented by symbols in the vocabulary. We show that this quantification should be distinguished from second-order quantification and…