Related papers: Formal Theories for Logspace Counting
An important theorem in classical complexity theory is that LOGLOGSPACE=REG, i.e. that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce…
A theorem of Lurie and Pridham establishes a correspondence between formal moduli problems and differential graded Lie algebras in characteristic zero, thereby formalising a well-known principle in deformation theory. We introduce a variant…
Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…
We investigate the position that foundational theories should be modelled on ordinary computability. In this context, we investigate the metamathematics of $\Sigma$ formulas. We consider theories whose axioms are implications between…
The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unifier of F. When a unifiable formula has minimal complete…
We will introduce new functional equations (\ref{eq:hana}) and (\ref{eq:hana2}) which are strongly related to well-known formulae (\ref{eq:young}) and (\ref{eq:young2}) of number theory, and investigate the solutions of the equations.…
We present a logic named L_{LF} whose intended use is to formalize properties of specifications developed in the dependently typed lambda calculus LF. The logic is parameterized by the LF signature that constitutes the specification. Atomic…
We initiate a study of the complexity of quantum field theories (QFTs) by proposing a measure of information contained in a QFT and its observables. We show that from minimal assertions, one is naturally led to measure complexity by two…
In this article we give strong versions for preparation theorems for $\mathbb{R}_{an,exp}$-definable functions outgoing from methods of Lion and Rolin ($\mathbb{R}_{an,exp}$ is the o-minimal structure generated by all restricted analytic…
We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Deformation theory is treated for locally notherian formal schemes (non necessarily smooth). The cotangent complex is defined in the derived category through the homology localization functor. The basic properties and results of a…
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…
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…
Dedekind domains and their class groups are notions in commutative algebra that are essential in algebraic number theory. We formalized these structures and several fundamental properties, including number theoretic finiteness results for…
We study circuit complexity for conformal field theory states in arbitrary dimensions. Our circuits start from a primary state and move along a unitary representation of the Lorentzian conformal group. Different choices of distance…
It is well understood that different neural network architectures are suited to different tasks, but is there always a single best architecture for a given task? We compare the expressive power of transformers, RNNs, and transformers with…
Generalising a previous work of Jiang and Sheng, a cohomology theory for differential Lie algebras of arbitrary weight is introduced. The underlying $L_\infty[1]$-structure on the cochain complex is also determined via a generalised version…
The theory of newforms, due to Atkin and Lehner, provides a powerful method for decomposing spaces of modular forms. However, many problems occur when trying to generalise this theory to characteristic $p$. Recently, Deo and Medvedovsky…
Functional Distributional Semantics provides a computationally tractable framework for learning truth-conditional semantics from a corpus. Previous work in this framework has provided a probabilistic version of first-order logic, recasting…