English
Related papers

Related papers: Affinization and quantifier-elimination

200 papers

We give a sufficient condition for quantising integrable systems.

Mathematical Physics · Physics 2008-02-13 Mauricio D. Garay , Duco van Straten

We study the model theory of the ring of adeles of a number field. We obtain quantifier elimination results in the language of rings and some enrichments. We given consequences for definable subsets of the adeles, and their measures.

Logic · Mathematics 2016-04-01 Jamshid Derakhshan , Angus Macintyre

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…

Logic in Computer Science · Computer Science 2007-05-23 Stefan Ratschan

Gravity does not naturally fit well with canonical quantization. Affine quantization is an alternative procedure that is similar to canonical quantization but may offer a positive result when canonical quantization fails to offer a positive…

General Relativity and Quantum Cosmology · Physics 2019-10-22 John R. Klauder

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

Logic · Mathematics 2018-04-18 Lars Kristiansen , Juvenal Murwanashyaka

We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…

Logic · Mathematics 2025-03-25 Maximilian Illmer , Tim Netzer

Affine quantization is a relatively new procedure, and it can solve many new problems. This essay reviews this new, and novel, procedure for particle problems, as well as those of fields and gravity. New quantization tools, which are…

General Physics · Physics 2023-10-19 John R. Klauder , Riccardo Fantoni

Discussed is the quantized version of the classical description of collective and internal affine modes as developed in Part I. We perform the Schr\"odinger quantization and reduce effectively the quantized problem from $n^{2}$ to $n$…

Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…

Logic · Mathematics 2023-11-08 Robert Goldblatt

We prove quantifier elimination for the theory of quasi-real closed fields with a compatible valuation. This unifies the same known results for algebraically closed valued fields and real closed valued fields.

Logic · Mathematics 2020-07-23 Mickaël Matusinski , Simon Müller

We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…

Logic in Computer Science · Computer Science 2014-01-20 Stefan Hetzl , Alexander Leitsch , Giselle Reis , Daniel Weller

The cofinality quantifiers were introduced by Shelah as an example of a compact logic stronger than first-order logic. We show that the classes of models axiomatized by these quantifiers can be turned into an Abstract Elementary Class by…

Logic · Mathematics 2025-04-16 Will Boney

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Logic · Mathematics 2013-08-29 Tarek Sayed Ahmed

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.

Logic · Mathematics 2009-05-07 Karim Nour , Christophe Raffalli

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

Algebraic Geometry · Mathematics 2026-05-05 Enrico Savi

Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…

Logic in Computer Science · Computer Science 2023-06-08 Bernard Boigelot , Pascal Fontaine , Baptiste Vergain

Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also…

Artificial Intelligence · Computer Science 2023-07-25 Chunxi Ji , Adnan Darwiche

In this paper a constructive formalization of quantifier elimination is presented, based on a classical formalization by Tobias Nipkow. The formalization is implemented and verified in the programming language/proof assistant Agda. It is…

Logic in Computer Science · Computer Science 2018-07-12 Jeremy Pope

Ext-int.\ one affine functions are functions affine in the direction of one-divisible exterior forms, with respect to exterior product in one variable and with respect to interior product in the other. The purpose of this article is to…

Functional Analysis · Mathematics 2025-04-02 Saugata Bandyopadhyay , Swarnendu Sil

We prove a highest weight theorem classifying irerducible finite--dimensional representations of quantum affine algebras and survey what is currently known about the structure of these representations.

High Energy Physics - Theory · Physics 2008-02-03 V. Chari , A. N. Pressley