Related papers: Characterising Complexity Classes by Inductive Def…
We define a class of Separation Logic formulae, whose entailment problem: given formulae $\phi, \psi_1, \ldots, \psi_n$, is every model of $\phi$ a model of some $\psi_i$? is 2EXPTIME-complete. The formulae in this class are existentially…
We consider pure equational theories that allow substitution but disallow induction, which we denote as PETS, based on recursive definition of their function symbols. We show that the Bounded Arithmetic theory $S^1_2$ proves the consistency…
We use finite group topological lattice gauge theory, also known as the quantum double model, as a lens to explore a notion of topological order enriched by a non-invertible symmetry. For invertible symmetry enriched topological order,…
The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…
The price of a financial derivative can be expressed as an iterated conditional expectation, where the inner term conditions on the future of an auxiliary process. We show that this inner conditional expectation solves an SPDE (a…
Induction is the process by which we obtain predictive laws or theories or models of the world. We consider the structural aspect of induction. We answer the question as to whether we can find a finite and minmalistic set of operations on…
We derive exact and closed-form expressions for a large class of two-point and three-point inflation correlators with the tree-level exchange of a single massive particle. The intermediate massive particle is allowed to have arbitrary mass,…
Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…
We reformulate the inductive McKay condition, from Isaacs-Malle-Navarro, and apply the new criterion to simple groups of Lie type, when the prime is the defining characteristic p. Thereby we make use of a recent result of Maslowski. This…
First-order logic (FOL) has proved to be a versatile and expressive tool as the basis of abstract modeling languages. Used to verify complex systems with unbounded domains, such as heap-manipulating programs and distributed protocols, FOL,…
The aim of these notes is to introduce the intuition motivating the notion of a "complicial set", a simplicial set with certain marked "thin" simplices that witness a composition relation between the simplices on their boundary. By varying…
Frege's theorem says that second-order Peano arithmetic is interpretable in Hume's Principle and full impredicative comprehension. Hume's Principle is one example of an abstraction principle, while another paradigmatic example is Basic Law…
We introduce the calculus of neo-Peircean relations, a string diagrammatic extension of the calculus of binary relations that has the same expressivity as first order logic and comes with a complete axiomatisation. The axioms are obtained…
The entailment between separation logic formulae with inductive predicates, also known as symbolic heaps, has been shown to be decidable for a large class of inductive definitions. Recently, a 2-EXPTIME algorithm was proposed and an…
The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification…
In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko V\"a\"aan\"anen as an extension of first-order (resp. modal) logic by the dependence operator =(). For first-order (resp. propositional) variables…
Bayesian inference provides a natural way of incorporating prior beliefs and assigning a probability measure to the space of hypotheses. Current solutions rely on iterative routines like Markov Chain Monte Carlo (MCMC) sampling and…
We consider a higher gauge topological model in three spatial dimensions whose input datum is a 2-group encoding the mixing of a 0-form $\mathbb Z_2$- and 1-form $\mathbb Z_3$-symmetry. We study the excitation content of the theory on the…
We show that the classical interpretations of Tarski's inductive definitions actually allow us to define the satisfaction and truth of the quantified formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers…