Related papers: Affinization and quantifier-elimination
We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…
The Euler characteristic of a finite category is defined and shown to be compatible with Euler characteristics of other types of object, including orbifolds. A formula for the cardinality of the colimit of a diagram of sets is proved,…
The affine coherent states quantization is a promising integral quantization of Hamiltonian systems when the phase space includes at least one conjugate pair of variables which takes values from a half-plane. Such a situation is common for…
We outline a new approach to classify real forms and automorphisms of finite order of affine Kac-Moody algebras.
We study the representation theory of quantizations of Gieseker moduli spaces. Namely, we prove the localization theorems for these algebras, describe their finite dimensional representations and two-sided ideals as well as their categories…
We show that the intuitionistic first-order theory of equality has continuum many complete extensions. We also study the Vitali equivalence relation and show there are many intuitionistically precise versions of it.
This paper is concerned with the question of when a theory is refutable with certainty on the basis of sequence of primitive observations. Beginning with the simple definition of falsifiability as the ability to be refuted by some finite…
We investigate the elimination of quantifiers in first-order formulas via Hilbert's epsilon-operator (or -binder), following Bernays' explicit definitions of the existential and the universal quantifier symbol by means of epsilon-terms.…
Although classical mechanics and quantum mechanics are separate disciplines, we live in a world where Planck's constant \hbar>0, meaning that the classical and quantum world views must actually {\it coexist}. Traditionally, canonical…
After highlighting the cases in which the semantics of a language cannot be mechanically reproduced (in which case it is called inherent), the main epistemological consequences of the first incompleteness Theorem for the two fundamental…
We give an algorithm determining whether a hermiticity-preserving superoperator is positive. In our approach we apply techniques of quantifier elimination theory for real numbers. Furthermore, we argue that quantifier elimination theory…
The operational axiomatization of quantum theory can be regarded as a set of six epistemological rules for falsifying propositions of the theory. In particular, the Purification postulate-the only one that is not shared with classical…
A new approach is demonstrated that QFTs can be UV finite if they are viewed as the low energy effective theories of a fundamental underlying theory (that is complete and well-defined in all respects) according to the nowaday's standard…
We define a notion of "theory of (1,infty)-categories", and we prove that such a theory is unique up to equivalence.
Manna and Waldinger's theory of substitutions and unification has been verified using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating…
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent systems with an arbitrary number of…
A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a…
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…
The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…