Related papers: Interpolation and Quantifiers in Ortholattices
Semiclassical quantization is exact only for the so called \emph{solvable} potentials, such as the harmonic oscillator. In the \emph{nonsolvable} case the semiclassical phase, given by a series in $\hbar$, yields more or less approximate…
We examine the interplay between projectivity (in the sense that was introduced by S.~Ghilardi) and uniform post-interpolant for the classical and intuitionistic propositional logic. More precisely, we explore whether a projective…
Elimination of quantifiers is shown to fail dramatically for a group of well-known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by…
We intend to investigate the metalogical property of 'omitting types' for a wide variety of quantifier logics (that can also be seen as multimodal logics upon identifying existential quantifiers with modalities syntactically and…
Hamiltonian systems of ordinary and partial differential equations are fundamental mathematical models spanning virtually all physical scales. A critical property for the robustness and stability of computational methods in such systems is…
We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon…
Every orthonomic system of partial differential equations is known to possess a finite number of integrability conditions sufficient to ensure the validity of all. Herewith we offer an efficient algorithm to construct a sufficient set of…
We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…
This paper builds upon our recent work, published in Lett. Math. Phys., 112: 94, 2022, where we established that the integrable Volterra lattice on a free associative algebra and the whole hierarchy of its symmetries admits a quantisation…
Quantum integrability of classical integrable systems given by quadratic Killing tensors on curved configuration spaces is investigated. It is proven that, using a "minimal" quantization scheme, quantum integrability is insured for a large…
We propose a realizability interpretation of a system for quantifier free arithmetic which is equivalent to the fragment of classical arithmetic without "nested" quantifiers, called here EM1-arithmetic. We interpret classical proofs as…
We build on our previous paper \cite{constructive} by using the general method introduced there in conjunction with invariant theory. This yields quantifier elimination results for the classical quaternions, octonions, as well as other…
We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for…
We consider the problem of checking whether a proposed invariant $\varphi$ expressed in first-order logic with quantifier alternation is inductive, i.e. preserved by a piece of code. While the problem is undecidable, modern SMT solvers can…
An overview of maximally superintegrable classical Hamitonians on spherically symmetric spaces is presented. It turns out that each of these systems can be considered either as an oscillator or as a Kepler-Coulomb Hamiltonian. We show that…
Motivated by quantum states with zero transition probability, we introduce the notion of ortho-set which is a set equipped with a relation $\neq_\mathrm{q}$ satisfying: $x\neq_\mathrm{q} y$ implies both $x\neq y$ and $y \neq_\mathrm{q} x$.…
A variety is said to be coherent if the finitely generated subalgebras of its finitely presented members are also finitely presented. In a recent paper by the authors it was shown that coherence forms a key ingredient of the uniform…
A methodology based upon recurrence quantification analysis is proposed for the study of orthographic structure of written texts. Five different orthographic data sets (20th century Italian poems, 20th century American poems, contemporary…
Uniform interpolation is the property that, for any formula and set of atoms, there exists the strongest consequence omitting those atoms. It plays a central role in knowledge representation and reasoning tasks such as knowledge update and…
Quantified CTL (QCTL) is a well-studied temporal logic that extends CTL with quantification over atomic propositions. It has recently come to the fore as a powerful intermediary framework to study logics for strategic reasoning. We extend…