English
Related papers

Related papers: Reformulating $\epsilon$-$\delta$ Limits in a Peda…

200 papers

We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.

Number Theory · Mathematics 2019-08-30 Jean-Marc Couveignes

This note proposes a new proof and new perspectives on the so-called Elliptical Potential Lemma. This result is important in online learning, especially for linear stochastic bandits. The original proof of the result, however short and…

Machine Learning · Statistics 2020-10-21 Alexandra Carpentier , Claire Vernade , Yasin Abbasi-Yadkori

In this survey, we present in a unified way the categorical and syntactical settings of coherent differentiation introduced recently, which shows that the basic ideas of differential linear logic and of the differential lambda-calculus are…

Logic in Computer Science · Computer Science 2024-01-29 Thomas Ehrhard

We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies…

Logic in Computer Science · Computer Science 2015-07-01 Dirk Pattinson , Lutz Schröder

Fisher's fiducial probability has recently received renewed attention under the name confidence. In this paper, we reformulate it within an extended-likelihood framework, a representation that helps to resolve many long-standing…

Statistics Theory · Mathematics 2026-01-01 Youngjo Lee

Supervised fine-tuning enhances the problem-solving abilities of language models across various mathematical reasoning tasks. To maximize such benefits, existing research focuses on broadening the training set with various data augmentation…

Computation and Language · Computer Science 2024-10-08 Zhihan Zhang , Tao Ge , Zhenwen Liang , Wenhao Yu , Dian Yu , Mengzhao Jia , Dong Yu , Meng Jiang

We introduce an elliptic extension of Clausen-type functions based on a unified recursive framework. Starting from the polylogarithmic master function, we construct a pair of circular functions whose real and imaginary parts correspond to…

General Mathematics · Mathematics 2026-03-10 Ken Nagai

We highlight the fact that in undergraduate calculus, the number pi is defined via the length of the circle, the length of the circle is defined as a certain value of an inverse trigonometric function, and this value is defined via pi, thus…

History and Overview · Mathematics 2021-10-15 Alexei Vernitski

The Dirac delta function is a standard mathematical tool that appears repeatedly in the undergraduate physics curriculum in multiple topical areas including electrostatics, and quantum mechanics. While Dirac delta functions are often…

Physics Education · Physics 2015-06-23 Bethany R. Wilcox , Steven J. Pollock

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic…

Software Engineering · Computer Science 2007-05-23 Ian Hayes , Robert Colvin , David Hemer , Paul Strooper , Ray Nickson

We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…

Logic in Computer Science · Computer Science 2023-12-21 Delia Kesner , Shane Ó Conchúir

Critical exponent $\eta$ for three-dimensional systems with $n$-vector order parameter is evaluated in the frame of pseudo-$\epsilon$ expansion approach. Pseudo-$\epsilon$ expansion ($\tau$-series) for $\eta$ found up to $\tau^7$ term for…

Statistical Mechanics · Physics 2015-06-18 A. I. Sokolov , M. A. Nikitina

The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the…

Logic in Computer Science · Computer Science 2016-08-16 Frédéric Blanqui

When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them,…

Logic in Computer Science · Computer Science 2016-01-08 Gilles Dowek

Some approaches to solving challenging dynamic programming problems, such as Q-learning, begin by transforming the Bellman equation into an alternative functional equation, in order to open up a new line of attack. Our paper studies this…

Optimization and Control · Mathematics 2019-12-05 Qingyin Ma , John Stachurski

Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also…

Logic in Computer Science · Computer Science 2012-10-12 Robbert Krebbers

The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic. Formal proofs in the sequent calculus are finite trees obtained…

Logic in Computer Science · Computer Science 2018-03-06 Arno Ehle , Norbert Hundeshagen , Martin Lange

Let $P\in \mathbb Z[X]\setminus\{0\}$ be of degree $\delta\ge 1$ and usual height $H\ge 1$, and let $\alpha\in \overline{\mathbb Q}^*$ be of degree $d\ge 2$. Mahler proved in 1931 the following transcendence measure for $e^\alpha$: for any…

Number Theory · Mathematics 2025-02-26 Stéphane Fischler , Tanguy Rivoal

Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…

Logic in Computer Science · Computer Science 2022-01-03 Esaïe Bauer , Olivier Laurent

Using ideas from the geometry of compression, we improve on the current upper and lower bounds of the Heilbronn triangle problem. In particular, let $\Delta(s)$ denote the minimal area of the triangle induced by $s$ points on a unit disk.…

Number Theory · Mathematics 2026-05-07 Theophilus Agama