相关论文: Avoiding logical strength in real analysis
We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e.…
Kruskal's theorem famously states that finite trees (ordered using an infima-preserving embeddability relation) form a well partial order. Freund, Rathjen, and Weiermann extended this result to general recursive data types with their…
It is well-known that natural axiomatic theories are pre-well-ordered by logical strength, according to various characterizations of logical strength such as consistency strength and inclusion of $\Pi^0_1$ theorems. Though these notions of…
The study of the Dirac system and second-order elliptic equations with complex-valued coefficients on the plane leads to bicomplex Vekua equations. To the difference of complex pseudoanalytic (generalized analytic) functions the theory of…
In this study, we study weak values from a quantum-logical viewpoint. In addition, we examine the validity of the counterfactual statements of Hardy's paradox, which are based on weak values, and we show that these statements have not been…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
The program Reverse Mathematics in the foundations of mathematics seeks to identify the minimal axioms required to prove theorems of ordinary mathematics. One always assumes the base theory, a logical system embodying computable…
Bell's theorem cannot be proved if complementary measurements have to be represented by random variables which cannot be added or multiplied. One such case occurs if their domains are not identical. The case more directly related to the…
A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanized using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express coinductive…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We study the reverse mathematics of infinitary extensions of the Hales-Jewett theorem, due to Carlson and Simpson. These theorems have multiple applications in Ramsey's theory, such as the existence of finite big Ramsey numbers for the…
This paper is concerned with the hypercoercivity property of solutions to the Cauchy problem on the linear Boltzmann equation with a confining potential force. We obtain the exponential time rate of solutions converging to the steady state…
A comprehensive convergence and stability analysis of some probabilistic numerical methods designed to solve Cauchy-type inverse problems is performed in this study. Such inverse problems aim at solving an elliptic partial differential…
The main features of the statistical approach to inverse problems are described on the example of a linear model with additive noise. The approach does not use any Bayesian hypothesis regarding an unknown object; instead, the standard…
The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite…
Applying machine learning to mathematical terms and formulas requires a suitable representation of formulas that is adequate for AI methods. In this paper, we develop an encoding that allows for logical properties to be preserved and is…
Reverse Mathematics is a program in the foundations of mathematics. Its results give rise to an elegant classification of theorems of ordinary mathematics based on computability. In particular, the majority of these theorems fall into only…
Scalar-tensor theories of gravity generally violate the strong equivalence principle, namely compact objects have a suppressed coupling to the scalar force, causing them to fall slower. A black hole is the extreme example where such a…
This paper aims to revisit the mathematical foundations of both General Relativity and Electromagnetism after one century, in the light of the formal theory of systems of partial differential equations and Lie pseudogroups (D.C. Spencer,…
In this paper the lightface $\Pi^{1}_{1}$-Comprehension axiom is shown to be proof-theoretically strong even over $\mbox{RCA}_{0}^{*}$, and we calibrate the proof-theoretic ordinals of weak fragments of the theory $\mbox{ID}_{1}$ of…