Related papers: Affinization and quantifier-elimination
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
We provide a complete proof of a duality theorem for the fppf cohomology of either a curve over a finite field or a ring of integers of a number field, which extends the classical Artin-Verdier Theorem in \'etale cohomology. We also prove…
Let $T$ be a complete strongly geometric theory of fields with quantifier elimination. We show that the theory of lovely pairs of $T$ has quantifier elimination in Delon's definitional expansion by predicates for linear independence and…
An inconsistency of quantum field theory, regarding the signs of vacuum energy and vacuum pressure of elementary fields versus non-elementary fields (like e.g. phonon fields), is pointed out. An improved law for the canonical quantization…
In this paper, we study the minimal affinizations over the quantum affine algebras of type $C_n$ by using the theory of cluster algebras. We show that the $q$-characters of a large family of minimal affinizations of type $C_n$ satisfy some…
A simple mathematical extension of quantum theory is presented. As well as opening the possibility of alternative methods of calculation, the additional formalism implies a new physical interpretation of the standard theory by providing a…
Cut-elimination is the bedrock of proof theory. It is the algorithm that eliminates cuts from a sequent calculus proof that leads to cut-free calculi and applications. Cut-elimination applies to many logics irrespective of their semantics.…
The rules of canonical quantization normally offer good results, but sometimes they fail, e.g., leading to quantum triviality ($=$ free) for certain examples that are classically nontrivial ($\ne$ free). A new procedure, called Enhanced…
We study a class of first-order theories whose complete quantifier-free types with one free variable either have a trivial positive part or are isolated by a positive quantifier-free formula--plus a few other technical requirements. The…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
Machine Learning classification models learn the relation between input as features and output as a class in order to predict the class for the new given input. Quantum Mechanics (QM) has already shown its effectiveness in many fields and…
A quantum integrable model is considered which describes a quantization of affine hyper-elliptic Jacobian. This model is shown to possess the property of duality: a dual model with inverse Planck constant exists such that the…
The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…
We investigate the presence of twinlike models in theories described by several real scalar fields. We focus on the first-order formalism, and we show how to build distinct scalar field theories that support the same extended solution, with…
The fuzzy quantification model FA has been identified as one of the best behaved quantification models in several revisions of the field of fuzzy quantification. This model is, to our knowledge, the unique one fulfilling the strict…
The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn fragments, which are better known as the…
We prove some results about the model theory of fields with a derivation of the Frobenius map, especially that the model companion of this theory is axiomatizable by axioms used by Wood in the case of the theory $\operatorname{DCF}_p$ and…
Invariant affine reflection algebras are the last and the most general known extension of affine Kac-Moody Lie algebras, introduced in recent years. We develop a method known as "affinization" to the class of invariant affine reflection…
The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…
We develop the theory of exact completions of regular $\infty$-categories, and show that the $\infty$-categorical exact completion (resp. hypercompletion) of an abelian category recovers the connective half of its bounded (resp. unbounded)…