English
Related papers

Related papers: The continuous functional calculus in Lean

200 papers

In order to combine operational and logical styles of specifications in one unified framework, the notion of logic labelled transition systems (Logic LTS, for short) has been presented and explored by L\"{u}ttgen and Vogler in [TCS…

Logic in Computer Science · Computer Science 2012-12-12 Yan Zhang , Zhaohui Zhu , Jinjin Zhang , Yong Zhou

Recent advances in large language models have demonstrated impressive capabilities in mathematical formalization. However, existing benchmarks focus on logical verification of declarative propositions, often neglecting the task of…

Logic in Computer Science · Computer Science 2026-02-03 Bowen Yang , Yi Yuan , Chenyi Li , Ziyu Wang , Liangqi Li , Bo Zhang , Zhe Li , Zaiwen Wen

The work is devoted to Computability Logic (CoL) -- the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing truth} by computability in its underlying semantics (see…

Logic in Computer Science · Computer Science 2012-08-03 Giorgi Japaridze

We present in this paper a canonical form for the elements in the ring of continuous piecewise polynomial functions. This new representation is based on the use of a particular class of functions $$\{C_i(P):P\in\Q[x],i=0,\ldots,\deg(P)\}$$…

Symbolic Computation · Computer Science 2014-11-26 Jorge Caravantes , M. Angeles Gomez-Molleda , Laureano Gonzalez-Vega

Autoformalization, the process of transforming informal mathematical propositions into verifiable formal representations, is a foundational task in automated theorem proving, offering a new perspective on the use of mathematics in both…

Artificial Intelligence · Computer Science 2025-07-04 Ke Weng , Lun Du , Sirui Li , Wangyue Lu , Haozhe Sun , Hengyu Liu , Tiancheng Zhang

We present a Coq formalization of the Quantified Reflection Calculus with one modality, or $\mathsf{QRC}_1$. This is a decidable, strictly positive, and quantified modal logic previously studied for its applications in proof theory. The…

Logic in Computer Science · Computer Science 2023-12-20 Ana de Almeida Borges

A family of partial functions of a class of algebras $\mathsf{K}$ is said to be an implicit operation of $\mathsf{K}$ when it is defined by a first order formula and it is preserved by homomorphisms. In this work, we develop the theory of…

Rings and Algebras · Mathematics 2026-04-24 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

In calculus, an indefinite integral of a function $f$ is a differentiable function $F$ whose derivative is equal to $f$. In present paper, we generalize this notion of the indefinite integral from the ring of real functions to any ring. The…

Rings and Algebras · Mathematics 2014-06-13 Iztok Banic

We develop the integral calculus for quasi-standard smooth functions defined on the ring of Fermat reals. The approach is by proving the existence and uniqueness of primitives. Besides the classical integral formulas, we show the…

Classical Analysis and ODEs · Mathematics 2015-07-30 Paolo Giordano , Enxin Wu

The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…

Logic in Computer Science · Computer Science 2023-09-26 Maria J. D. Lima , Flávio L. C. de Moura

Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…

Logic in Computer Science · Computer Science 2016-09-27 Olivier Bournez , Walid Gomaa , Emmanuel Hainry

Translating natural language mathematical statements into formal, executable code is a fundamental challenge in automated theorem proving. While prior work has focused on generation and compilation success, little attention has been paid to…

There is a substantial curricular overlap between calculus and physics, yet introductory physics students often struggle to connect the two. We introduce a quantity-based framing of the Fundamental Theorem of Calculus (FTC) to help unify…

Physics Education · Physics 2025-07-28 Suzanne White Brahmia , Patrick W. Thompson

We present the Sequent Calculus Trainer, a tool that supports students in learning how to correctly construct proofs in the sequent calculus for first-order logic with equality. It is a proof assistant fostering the understanding of all the…

Computers and Society · Computer Science 2015-07-15 Arno Ehle , Norbert Hundeshagen , Martin Lange

Calcium is a C library for real and complex numbers in a form suitable for exact algebraic and symbolic computation. Numbers are represented as elements of fields $\mathbb{Q}(a_1,\ldots,a_n)$ where the extensions numbers $a_k$ may be…

Mathematical Software · Computer Science 2020-11-04 Fredrik Johansson

We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in the…

Logic in Computer Science · Computer Science 2023-06-22 Florian Steinberg , Laurent Thery , Holger Thies

Reversible concurrent calculi are abstract models for concurrent systems in which any action can potentially be undone. Over the last few decades, different formalisms have been developed and their mathematical properties have been…

Logic in Computer Science · Computer Science 2025-08-20 Gabriele Cecilia

We introduce notions of absolutely continuous functionals and representations on the non-commutative disk algebra $A_n$. Absolutely continuous functionals are used to help identify the type L part of the free semigroup algebra associated to…

Operator Algebras · Mathematics 2007-05-23 Kenneth R. Davidson , Jiankui Li , David R. Pitts

A functional calculus for an order complete vector lattice $\mathcal{E}$ was developed by Grobler in 2014 using the Daniell integral. We show that if one represents the universal completion of $\mathcal{E}$ as $C^\infty(K)$, then the…

Functional Analysis · Mathematics 2023-11-28 Achintya Raya Polavarapu

Formal theories of arithmetic have traditionally been based on either classical or intuitionistic logic, leading to the development of Peano and Heyting arithmetic, respectively. We propose to use $\mu$MALL as a formal theory of arithmetic…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Manighetti , Dale Miller