相关论文: Remarks on Barr's theorem: Proofs in geometric the…
We illustrate the generative power of the lifting property (orthogonality of morphisms in a category) as means of defining natural elementary mathematical concepts by giving a number of examples in various categories, in particular showing…
A classic result due to Bernstein states that in set theory with classical logic, but without the axiom of choice, for all sets $X$ and $Y$, if $X \times 2 \cong Y \times 2$ then also $X \cong Y$. We show that this cannot be done in…
Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open…
This note is purely expository. The statement of the Gauss theorem on the constructibility of regular polygons by means of compass and ruler is simple and well-known. However, its proofs given in most textbooks rely upon much unmotivated…
One often sees a sharp distinction in mathematics between descriptions from the outside and from the inside. Think of defining a set in the plane through an algebraic equation, or dynamically as the closure of the orbit of some point under…
We use G\"{o}del's Dialectica interpretation to produce a computational version of the well known proof of Ramsey's theorem by Erd\H{o}s and Rado. Our proof makes use of the product of selection functions, which forms an intuitive…
We translate properties of the Sigma-type in Martin-L\"of Type Theory (MLTT) to properties of the Grothendieck construction in category theory. Namely, equivalences in MLTT that involve the Sigma-type motivate isomorphisms between…
We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
One of the most fundamental mathematical contributions of Garrett Birkhoff is the HSP theorem, which implies that a finite algebra B satisfies all equations that hold in a finite algebra A of the same signature if and only if B is a…
We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…
Baroque questions of set-theoretic foundations are widely assumed to be irrelevant to physics. In this article, I demonstrate that this assumption is incorrect. I show that the fundamental physical question of whether a theory is…
We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven assuming the full power of classical logic. The key ingredient…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
We present constructive provability logic, an intuitionstic modal logic that validates the L\"ob rule of G\"odel and L\"ob's provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and…
This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…
The theorem of Barth-Lefschetz is a statement about the cohomology of a submanifold X of some projective space, in a range depending on the codimension of the embedding. Here this is generalized to the case of a submanifold X of a smooth…
This paper describes an axiomatic theory BT for constructive mathematics. BT has a predicative comprehension axiom for a countable number of set types and usual combinatorial operations. BT has intuitionistic logic, is consistent with…
The classifying topos of a geometric theory is a topos such that geometric morphisms into it correspond to models of that theory. We study classifying toposes for different infinitary logics: first-order, sub-first-order (i.e. geometric…
Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.