相关论文: Brown's lemma in second-order arithmetic

Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO + LFP) formula is equivalent to a first-order formula in K. Here (FO + LFP) is the extension of first-order logic with…

Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…

We show that the universally axiomatized, induction-free theory PA^- is a sequential theory in the sense of Pudl\'ak [5], in contrast to the closely related Robinson's arithmetic.

It is well known that Sperner lemma is equivalent to Brouwer fixed-point theorem. Tanaka [12] proved that Brouwer theorem is equivalent to Arrow theorem, hence Arrow theorem is equivalent to Sperner lemma. In this paper we will prove this…

Let $k$ be a number field, let $X$ be a Kummer variety over $k$, and let $\delta$ be an odd integer. In the spirit of a result by Yongqi Liang, we relate the arithmetic of rational points over finite extensions of $k$ to that of zero-cycles…

Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we…

We show that each level of the quantifier alternation hierarchy within FO^2[<] -- the 2-variable fragment of the first order logic of order on words -- is a variety of languages. We then use the notion of condensed rankers, a refinement of…

We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…

The second-order cone plays an important role in convex optimization and has strong expressive abilities despite its apparent simplicity. Second-order cone formulations can also be solved more efficiently than semidefinite programming in…

In the context of extriangulated categories, we establish the injective version of Schanuel's lemma in homological algebra.

Michael Rathjen and the present author have shown that $\Pi^1_1$-bar induction is equivalent to (a suitable formalization of) the statement that every normal function has a derivative, provably in $\mathbf{ACA_0}$. In this note we show that…

We study the 2-adic version of the ring $C^*$-algebra of the integers. First, we work out the precise relation between the Cuntz algebra $\cO_2$ and our 2-adic ring $C^*$-algebra in terms of representations. Secondly, we prove a 2-adic…

I give a mini-survey of several approaches to the $A_2$ theorem, biased towards the "corona" rather than the "Bellman" side of the coin. There are two new results (a streamlined form of Lerner's local oscillation formula, and the sharpness…

This paper finally fully elaborates the tree pulldown method used by one of us (Harrington) to settle McLaughlin's conjecture. This method enables the construction of a computable tree $T_0$ whose paths are incomparable over $0^{(\alpha)}$…

For a finite-dimensional algebra {\Lambda}, we establish an explicit bijection between widely generated torsion(-free) classes and semibricks in mod {\Lambda}. Using the kappa order on the lattice of torsion classes with canonical join…

We study the modal logic of the closure algebra $P_2$, generated by the set of all polygons in the Euclidean plane $\mathbb{R}^2$. We show that this logic is finitely axiomatizable, is complete with respect to the class of frames we call…

Inductive proofs can be represented as proof schemata, i.e. as parameterized sequences of proofs defined in a primitive recursive way. Applications of proof schemata can be found in the area of automated proof analysis where the schemata…

We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the…

Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The reason for that is that in first-order logic induction requires…

We investigate the logical strength of the cohesiveness principle when restricted to finite sequences of sets, denoted by fin-COH, over different base theories. Our main result shows that fin-COH entails $I\Sigma_1^0$ over the weaker base…