Related papers: Quantifier-free formulas and quantifier alternatio…
We introduce and investigate the concept of Stratified Algebra, a new algebraic framework equipped with a layer-based structure on a vector space. We formalize a set of axioms governing intra-layer and inter-layer interactions, study their…
We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…
We review a notion of completeness in QFT arising from the analysis of basic properties of the set of operator algebras attached to regions. In words, this completeness asserts that the physical observable algebras produced by local degrees…
Trustworthy deployment of ML models requires a proper measure of uncertainty, especially in safety-critical applications. We focus on uncertainty quantification (UQ) for classification problems via two avenues -- prediction sets using…
Our concern is the axiomatisation problem for modal and algebraic logics that correspond to various fragments of two-variable first-order logic with counting quantifiers. In particular, we consider modal products with Diff, the…
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…
Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…
This note studies the quantized corner structure of four-dimensional $BF$ theory, classifies the associated free and physical corner algebras and constructs possible representations. In the abelian case, for arbitrary closed oriented…
We quantize abelian Yang-Mills theory on Riemannian manifolds with boundaries in any dimension. The quantization proceeds in two steps. First, the classical theory is encoded into an axiomatic form describing solution spaces associated to…
One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…
We analyse in detail the quantization of a simple noncommutative model of spontaneous symmetry breaking in zero dimensions taking into account the noncommutative setting seriously. The connection to the counting argument of Feyman diagrams…
New foundations for quantum logic and quantum spaces are constructed by merging algebraic quantum theory and topos theory. Interpreting Bohr's "doctrine of classical concepts" mathematically, given a quantum theory described by a…
A first-order logic with quantum variables is needed as an assertion language for specifying and reasoning about various properties (e.g. correctness) of quantum programs. Surprisingly, such a logic is missing in the literature, and the…
We introduce a foundational sheaf theoretical scheme for the comprehension of quantum event structures, in terms of localization systems consisting of Boolean coordinatization coverings induced by measurement. The scheme is based on the…
The concept of quantization consists in replacing commutative quantities by noncommutative ones. In mathematical language an algebra of continuous functions on a locally compact topological space is replaced with a noncommutative…
We implement the so-called Weyl-Heisenberg covariant integral quantization in the case of a classical system constrained by a bounded or semi-bounded geometry. The procedure, which is free of the ordering problem of operators, is…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
We introduce tree-width for first order formulae \phi, fotw(\phi). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formulae of bounded fotw, model checking is fixed…
In a recent paper [2], Chang et al. have proposed studying "Quantum $\mathbb{F}_{un}$": the $q \mapsto 1$ limit of Modal Quantum Theories over finite fields $\mathbb{F}_q$, motivated by the fact that such limit theories can be naturally…