Related papers: Proof of Compositionality of CFT Correctness
We present a framework for studying circuit complexity that is inspired by techniques that are used for analyzing the complexity of CSPs. We prove that the circuit complexity of a Boolean function $f$ is characterized by the partial…
Cyber-physical systems, like Smart Buildings and power plants, have to meet high standards, both in terms of reliability and availability. Such metrics are typically evaluated using Fault trees (FTs) and do not consider maintenance…
In the paper, we review the recent construction of the Liouville conformal field theory (CFT) from probabilistic methods, and the formalization of the conformal bootstrap. This model has offered a fruitful playground to unify the…
We discuss string theory methods for the study of strongly coupled holographic defect conformal field theories (CFTs) which are dual to probe-brane systems. First, we examine whether the string theory duals of such defect CFTs are…
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…
We introduce a novel technique for checking reachability in Petri nets that relies on a recently introduced compositional algebra of nets. We prove that the technique is correct, and discuss our implementation. We report promising…
This article is a conceptual exposition on the structure of the tree. It demonstrates an evolutionary design that the tree possesses in the perspective of a structural engineer.
We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method which should be well known but is often neglected. Also, we…
Every system of any significant size is created by composition from smaller sub-systems or components. It is thus fruitful to analyze the fault-tolerance of a system as a function of its composition. In this paper, two basic types of system…
Turing progressions arise by iteratedly adding consistency statements to a base theory. Different notions of consistency give rise to different Turing progressions. In this paper we present a logic that generates exactly all relations that…
CPT invariance in neutrino physics has attracted attention after the revival of the hypothetical idea that neutrino and antineutrino might have nonequal masses ($m_{\bar\nu} \neq m_{\nu}$) when realizing neutrino oscillations as a new…
Entanglement is resolved in conformal field theory (CFT) with respect to conformal families to all orders in the UV cutoff. To leading order, symmetry-resolved entanglement is connected to the quantum dimension of a conformal family, while…
In this article we describe the formalisation of the Bruhat-Tits tree - an important tool in modern number theory - in the Lean Theorem Prover. Motivated by the goal of connecting to ongoing research, we apply our formalisation to verify a…
Two-dimensional conformal field theory (CFT) can be defined through its correlation functions. These must satisfy certain consistency conditions which arise from the cutting of world sheets along circles or intervals. The construction of a…
In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to…
Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…
A mechanism for spontaneous CPT breaking appears in string theory. Possible implications for present-energy particle models are discussed. A realistic string theory might exhibit CPT violation at levels detectable in current or future…
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…
We provide an overview of CPF, the certification problem format, and explain some design decisions. Whereas CPF was originally invented to combine three different formats for termination proofs into a single one, in the meanwhile proofs for…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…