Related papers: Simplifying the axiomatization for the ordered aff…
There are several finite axiomatizations of stratified comprehension. The famous two are Hailperin's and Randall Holmes's. However, the system presented here could be the shortest known one written in the first order language of set theory.…
The automorphism groups of the 27 lines on the smooth cubic surface or the 28 bitangents to the general quartic plane curve are well-known to be closely related to the Weyl groups of $E\_6$ and $E\_7$. We show how classical…
In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set…
The idea of standardised co-ordinates in three-dimensional affine space is defined, by way of the Standard tetrahedron. By performing an affine map on a general tetrahedron, we may replace the study of a general tetrahedron over a specific…
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…
Euclidean geometry consists of straightedge-and-compass constructions and reasoning about the results of those constructions. We show that Euclidean geometry can be developed using only intuitionistic logic. We consider three versions of…
With this chapter we provide a compact yet complete survey of two most remarkable "representation theorems": every arguesian projective geometry is represented by an essentially unique vector space, and every arguesian Hilbert geometry is…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
In this work we define, for the first time, the affine and projective plane over the real Okubo algebra, showing a concrete geometrical interpretation of its Spin group. Okubo algebra is a flexible, composition algebra which is also a not…
Rosenfeld postulated ``generalized'' projective planes, which exploit a correspondence between rank-one idempotents of Jordan algebras $\mathfrak{J}_3(\mathbb{A})$ and points of projective planes $\mathbb{A}P^2$. The isometry groups of the…
We present a construction of a certain infinite complete partial order (CPO) that differs from the standard construction used in Scott's denotational semantics. In addition, we construct several other infinite CPO's. For some of those, we…
Hybrid topologies on the real line have been studied by various authors. Among the hybrid spaces, there are also Hattori spaces. However, some of the hybrid spaces are not homeomorphic to Hattori spaces. In this article, a common…
This book can be seen either as a text on theorem proving that uses techniques from general algebra, or else as a text on general algebra illustrated and made concrete by practical exercises in theorem proving. The book considers several…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
We prove that every simply connected orthogonal polygon of $n$ vertices can be partitioned into $\left\lfloor\frac{3 n +4}{16}\right\rfloor$ (simply connected) orthogonal polygons of at most 8 vertices. It yields a new and shorter proof of…
Zorn's Lemma is a well-known equivalent of the Axiom of Choice. It is usually regarded as a topic in axiomatic set theory, and its historically standard proof (from the Axiom of Choice) relies on transfinite recursion, a non-elementary…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact…
Geometry is essentially a global language, which is fully understood in different times, countries and cultures. The proof of a geometric theorem (e.g. the Pythagorean Theorem) or a geometric construction (e.g. the construction of an…
Many recent studies on first-order methods (FOMs) focus on \emph{composite non-convex non-smooth} optimization with linear and/or nonlinear function constraints. Upper (or worst-case) complexity bounds have been established for these…