English
Related papers

Related papers: Quantifier-free descriptions for quantifier soluti…

200 papers

We propose a linear independence criterion, and outline an application of it. Down to its simplest case, it aims at solving this problem: given three real numbers, typically as special values of analytic functions, how to prove that the…

Number Theory · Mathematics 2022-01-11 Raffaele Marcovecchio

Linear systems often involve, as a basic building block, solutions of equations of the form \begin{align*} A_Sx_S&+A_Px_P =0\\ A'_Sx_S & =0, \end{align*} where our primary interest might be in the vector variable $x_P.$ Usually, neither…

General Mathematics · Mathematics 2016-09-27 H. Narayanan

We propose that observables in quantum theory are properly understood as representatives of symmetry-invariant quantities relating one system to another, the latter to be called a reference system. We provide a rigorous mathematical…

Quantum Physics · Physics 2018-03-14 Leon Loveridge , Takayuki Miyadera , Paul Busch

We report briefly on an approach to quantum theory entirely based on symmetry grounds which improves Geometric Quantization in some respects and provides an alternative to the canonical framework. The present scheme, being typically…

Mathematical Physics · Physics 2012-01-18 V. Aldaya , M. Calixto , J. Guerrero , F F López-Ruiz

We consider linear systems of equations and inequalities with coefficients varying inside given intervals. We define their solutions (so called AE solutions) and solvability (so called AE solvability) by using forall-exists quantification…

Numerical Analysis · Mathematics 2019-05-27 Milan Hladík

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

Logic in Computer Science · Computer Science 2023-03-31 Miguel Campercholi , Mauricio Tellechea , Pablo Ventura

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…

Computational Complexity · Computer Science 2016-02-02 Jaroslav Horáček , Milan Hladík , Michal Černý

We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…

General Mathematics · Mathematics 2025-05-19 Barreto Joaquim Reizi

Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and…

Artificial Intelligence · Computer Science 2013-01-30 Dan Geiger , Christopher Meek

We obtain a complete characterization of planar monotone $\sigma$-continuous valuations taking integer values, without assuming invariance under any group of transformations. We further investigate the consequences of dropping monotonicity…

Metric Geometry · Mathematics 2026-01-23 Andrii Ilienko , Ilya Molchanov , Tommaso Visonà

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…

Discrete Mathematics · Computer Science 2015-03-19 Zoltan Esik

We study a family of integrable systems of nonlinearly coupled harmonic oscillators on the classical and quantum levels. We show that the integrability of these systems follows from their symmetry characterized by algebras called here…

Mathematical Physics · Physics 2016-06-22 A. Odzijewicz , E. Wawreniuk

We study general quantum integrable Hamiltonians linear in a coupling constant and represented by finite NxN real symmetric matrices. The restriction on the coupling dependence leads to a natural notion of nontrivial integrals of motion and…

Other Condensed Matter · Physics 2011-09-13 Haile K. Owusu , Emil A. Yuzbashyan

This paper presents rules in sequent calculus for a binary quantifier $I$ to formalise definite descriptions: $Ix[F, G]$ means `The $F$ is $G$'. The rules are suitable to be added to a system of positive free logic. The paper extends the…

Logic · Mathematics 2021-08-24 Nils Kürbis

The relativistic semi-classical approximation for a free massive particle is studied using the Wigner-Weyl formalism. A non-covariant Wigner function is proposed using the Newton-Wigner position operator. The perturbative solution for the…

High Energy Physics - Theory · Physics 2007-05-23 J. Mourad

Family of quasi-arithmetic means has a natural, partial order (point-wise order) $A^{[f]}\le A^{[g]}$ if and only if $A^{[f]}(v)\le A^{[g]}(v)$ for all admissible vectors $v$ ($f,\,g$ and, later, $h$ are continuous and monotone and defined…

Classical Analysis and ODEs · Mathematics 2022-06-10 Paweł Pasteczka

We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…

Logic in Computer Science · Computer Science 2026-04-20 Gilles Dowek , Murdoch J. Gabbay

This paper presents a way of formalising definite descriptions with a binary quantifier $\iota$, where $\iota x[F, G]$ is read as `The $F$ is $G$'. Introduction and elimination rules for $\iota$ in a system of intuitionist negative free…

Logic in Computer Science · Computer Science 2021-08-12 Nils Kürbis

This paper illustrates the combinatorial approach to vertex algebra - study of vertex algebras presented by generators and relations. A necessary ingredient of this method is the notion of free vertex algebra. Borcherds \cite{bor} was the…

Quantum Algebra · Mathematics 2007-05-23 Michael Roitman

In this paper we give an overview of results on the analysis of parametric linear hybrid automata, and of systems of similar linear hybrid automata: We present possibilities of describing systems with a parametric (i.e. not explicitly…

Logic in Computer Science · Computer Science 2025-05-15 Viorica Sofronie-Stokkermans , Philipp Marohn