相关论文: From real analysis to the sorites paradox via Reve…

We explore a relationship between the classical representation theory of a complex, semisimple Lie algebra \g and the resonance varieties R(V,K)\subset V^* attached to irreducible \g-modules V and submodules K\subset V\wedge V. In the…

The program Reverse Mathematics (RM for short) seeks to identify the axioms necessary to prove theorems of ordinary mathematics, usually working in the language of second-order arithmetic $L_{2}$. A major theme in RM is therefore the study…

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…

In his book, John Stillwell wrote "finding the exact strength of the Brouwer invariance theorems seems to me one of the most interesting open problems in reverse mathematics." In this article, we solve Stillwell's problem by showing that…

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…

We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…

In this note devoted to some aspects of the inverse problem of representation theory the attention is concentrated on the interrelations between various algebraic structures (algebras with operators) unraveled by different solutions of the…

The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…

We present and analyze a natural hierarchy of weak theories, develop analysis in them, and show that they are interpretable in bounded quantifier arithmetic $\text{I}\Delta_0$ (and hence in Robinson arithmetic Q). The strongest theories…

Motivated by recent results on the (possibly conditional) regularity for time-dependent hypoelliptic equations, we prove a parabolic version of the Poincar\'e inequality, and as a consequence, we deduce a version of the classical Moser…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…

This note being devoted to some aspects of the inverse problem of representation theory contains a new insight into it illustrated by two topics. The attention is concentrated on the manner of representation of abstract objects by the…

In this paper, we propose a weak regularity principle which is similar to both weak K\"onig's lemma and Ramsey's theorem. We begin by studying the computational strength of this principle in the context of reverse mathematics. We then…

This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…

We prove a new converse theorem for Borcherds' multiplicative theta lift which improves the previously known results. To this end we develop a newform theory for vector valued modular forms for the Weil representation, which might be of…

We derive the discrete version of the classical Helmholtz condition. Precisely, we state a theorem characterizing second order finite differences equations admitting a Lagrangian formulation. Moreover, in the affirmative case, we provide…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

We study a class of algebras with non-Lie commutation relations whose symplectic leaves are surfaces of revolution: a cylinder or a torus. Over each of such surfaces we introduce a family of complex structures and Hilbert spaces of…

In this paper, we consider the problem of learning a first-order theorem prover that uses a representation of beliefs in mathematical claims to construct proofs. The inspiration for doing so comes from the practices of human mathematicians…