相关论文: On the logical strength of Nash-Williams' theorem …

We prove that an irreducible quasifinite module over the central extension of the Lie algebra of $N\times N$-matrix differential operators on the circle is either a highest or lowest weight module or else a module of the intermediate…

We prove that Higman's lemma is strictly stronger for better quasi orders than for well quasi orders, within the framework of reverse mathematics. In fact, we show a stronger result: the infinite Ramsey theorem (for tuples of all lengths)…

We show that $\mathbf{C}$, a weak theory of sets with Axiom Beta, proves the scheme of Elementary, or $\Delta_0$ Transfinite Recursion and can generate, for every set, the corresponding relativized constructible hierarchy. We show that the…

Two rooted locally finite trees are considered equivalent if both can be embedded into each other as topological minors by means of tree-order preserving mappings. By exploiting Nash-William's Theorem, Matthiesen provided a non-constructive…

Earlier papers \cite{VB2022,VB2023a,VB2023b} introduced the notions of a core and an index of a relation (an index being a special case of a core). A limited form of the axiom of choice was postulated -- specifically that all partial…

This paper uses the framework of reverse mathematics to investigate the strength of two recurrence theorems of topological dynamics. It establishes that one of these theorems, the existence of an almost periodic point, lies strictly between…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

It is shown that the pillars of transfinite set theory, namely the uncountability proofs, do not hold. (1) Cantor's first proof of the uncountability of the set of all real numbers does not apply to the set of irrational numbers alone, and,…

We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…

We study duality theorems for the relative logarithmic de Rham-Witt sheaves on semi-stable schemes $X$ over a local ring $\mathbb{F}_q[[t]]$, where $\mathbb{F}_q$ is a finite field. As an application, we obtain a new filtration on the…

We show that under certain conditions, well-studied algebraic properties transfer from the class $\mathcal{Q}_{_\text{RFSI}}$ of the relatively finitely subdirectly irreducible members of a quasivariety $\mathcal{Q}$ to the whole…

We prove a relative version over $\mathbb{Q}$ of Nash-Tognoli theorem, that is: Let $M$ be a compact smooth manifold with closed smooth submanifolds $M_1,\dots,M_\ell$ in general position, then there exists a nonsingular real algebraic set…

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

Szemeredi's regularity lemma can be viewed as a rough structure theorem for arbitrary dense graphs, decomposing such graphs into a structured piece (a partition into cells with edge densities), a small error (corresponding to irregular…

We study the constructible Witt theory of \'etale sheaves of $\Lambda$-modules on a scheme $X$ for coefficient rings $\Lambda$ having finite characteristic not equal to 2 and prime to the residue characteristics of the scheme $X$. Our…

An embedding theorem for algebraic systems is presented, basing on a certain old ultrafilter construction. As an application, we outline alternative proofs of some results from the theory of PI algebras, and establish some properties of…

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

We show that there is a $\beta$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $\Pi^1_2$-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that…

The cohomology of coherent sheaves and sheaves of Abelian groups on Noetherian schemes are interpreted in second order arithmetic by means of a finiteness theorem. This finiteness theorem provably fails for the etale topology even on…

This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…