English
Related papers

Related papers: Effective infinitesimals in R

200 papers

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Formal Languages and Automata Theory · Computer Science 2009-07-06 M. Rigo , L. Waxweiler

This paper studies axioms for nonmonotonic consequences from a semantics-based point of view, focusing on a class of mathematical structures for reasoning about partial information without a predefined syntax/logic. This structure is called…

Logic in Computer Science · Computer Science 2007-05-23 Guo-Qiang Zhang

The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…

Logic · Mathematics 2024-06-04 Sandra Müller

Electroweak Sudakov corrections of the form alpha^n log^m s/M_{W,Z}^2 are summed using renormalization group evolution in soft-collinear effective theory (SCET). Results are given for the scalar, vector and tensor form-factors for fermion…

High Energy Physics - Phenomenology · Physics 2008-11-26 Jui-yu Chiu , Frank Golf , Randall Kelley , Aneesh V. Manohar

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

Number Theory · Mathematics 2019-07-30 Peter Müller

We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…

Numerical Analysis · Mathematics 2020-10-15 Irmina Walawska , Daniel Wilczak

Kronecker's Theorem and Rabin's Theorem are fundamental results about computable fields F and the decidability of the set of irreducible polynomials over F. We adapt these theorems to the setting of differential fields K, with constrained…

Commutative Algebra · Mathematics 2014-04-15 Russell Miller , Alexey Ovchinnikov , Dmitry Trushin

For stochastic implicit Taylor methods that use an iterative scheme to compute their numerical solution, stochastic B--series and corresponding growth functions are constructed. From these, convergence results based on the order of the…

Numerical Analysis · Mathematics 2011-09-22 Kristian Debrabant , Anne Kværnø

Restricted non-deterministic matrices (RNmatrices) impose constraints on the rows of non-deterministic matrices (Nmatrices), filtering out "unsound" rows and retaining only "valid" ones. This yields a more expressive framework than standard…

Logic in Computer Science · Computer Science 2026-05-07 Renato R. Leme , Carlos Olarte , Elaine Pimentel

The theory of integral quadratic constraints (IQCs) allows verification of stability and gain-bound properties of systems containing nonlinear or uncertain elements. Gain bounds often imply exponential stability, but it can be challenging…

Systems and Control · Computer Science 2017-06-06 Ross Boczar , Laurent Lessard , Andrew Packard , Benjamin Recht

Effective Field Theory (EFT) provides a powerful framework that exploits a separation of scales in physical systems to perform systematically improvable, model-independent calculations. Particularly interesting are few-body systems with…

Other Condensed Matter · Physics 2009-11-10 H. -W. Hammer

All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…

Logic · Mathematics 2023-10-04 Nikolaos Galatos , Gavin St. John

Motivated by problems arising in the relative trace formula and arithmetic invariant theory we prove the existence of rational points on orbits arising from certain infinitesimal symmetric spaces. As an application, we prove analogous…

Number Theory · Mathematics 2019-03-05 Trung Can , Chung-Ru Lee , Benjamin Nativi , Gary Zhou

We design hypersequent calculus proof systems for the theories of Riesz spaces and modal Riesz spaces and prove the key theorems: soundness, completeness and cut elimination. These are then used to obtain completely syntactic proofs of some…

Logic in Computer Science · Computer Science 2023-06-22 Christophe Lucas , Matteo Mio

This is a significant revision of the early version of this paper which was posted last December. The speculative section has been removed in light of some recent results of Morita and Kawazumi. Numerous typos have been fixed. The companion…

alg-geom · Mathematics 2008-02-03 Richard Hain

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…

Probability · Mathematics 2016-02-12 Yoichi Nishiyama

Implementations of known reductions of the Strong Real Jacobian Conjecture (SRJC), to the case of an identity map plus cubic homogeneous or cubic linear terms, and to the case of gradient maps, are shown to preserve significant algebraic…

Algebraic Geometry · Mathematics 2014-01-28 L. Andrew Campbell

We show that the theory ZFC-, consisting of the usual axioms of ZFC but with the power set axiom removed-specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every…

Logic · Mathematics 2015-08-05 Victoria Gitman , Joel David Hamkins , Thomas A. Johnstone

After the discovery of a new resonance, its couplings to the Standard Model (SM) need to be described by the means of an effective theory, appropriately constructed to separate its mass scale from the mass scales associated with the SM…

High Energy Physics - Phenomenology · Physics 2019-05-17 Matthias König

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n, all but countably many reals are n-random for such a measure,…

Logic · Mathematics 2021-04-06 Jan Reimann , Theodore A. Slaman