Errata for the paper "Equationally compact algebras II" (Fundamenta Mathematica 61 (1968), pp. 271-281)
Errata to "Lindelöf indestructibility, topological games and selection principles" (Fund. Math. 210 (2010), 1-46)
In [Fund. Math. 210 (2010), 1-46] we claimed the truth of two statements, one now known to be false and a second lacking a proof. In this "Errata" we report these matters in the interest of setting the record straight on the status of these claims.
Errata to the article ``Topologies on quantum logics induced by measures''
Errata to the paper "Generalizing Vaught sentences from ω to strong cofinality ω", Fundamenta Mathematicae 82 (1974), pp. 105-119
Errata to the paper "Models of second order arithmetic with definable Skolem functions", Fundamenta Mathematicae 75 (1972), pp. 223-234
Errata to the paper "Remarks of the elementary theories of formal and convergent power series" Fundamenta Mathematicae 105 (1980), pp. 229-239
Erratum to: “Elementary embeddings in torsion-free hyperbolic groups”
Erratum to "Fields of surreal numbers and exponentiation" (Fund. Math. 167 (2001), 173-188)
Erratum to “Hyperfinite and standard unifications for physical theories”.
Erratum to the paper "The Axion of Choice, the Löwenheim–Skolem Theorem and Borel models" (Fund. Math. 137 (1991), 53-58)
Erweiterte Fassung eines von Clebsch aufgestellten Uebertragungsprincips und deren Anwendung
Espaces de Berkovich, polytopes, squelettes et théorie des modèles : erratum
Esquisses et types
Essai sur la généralisation naturelle de la logique usuelle (premier mémoire)
Essai sur les principes fondamentaux de la géométrie et de la mécanique [Book]
Essentially Rigid Floppy Subgroups of the Baer-Specker Group.
Estensioni contraddittorie della teoria Ampia
Dopo una breve presentazione della teoria , una teoria non riduzionista ed autoreferenziale dei fondamenti della matematica proposta da Clavelli, De Giorgi, Forti e Tortorelli nel 1987, si mostra l'inconsistenza di estensioni della teoria ottenute aggiungendo forti assiomi su relazioni e operazioni (ad es. assiomi che danno la composizione di operazioni, la congiunzione di relazioni, ecc.) e/o assiomi che forniscono qualche relazione "combinatoria".
Estimation of the algorithmic complexity of classes of computable models.
Étude et implémentation d'un système de déduction pour logique algorithmique
Euler’s Partition Theorem
In this article we prove the Euler’s Partition Theorem which states that the number of integer partitions with odd parts equals the number of partitions with distinct parts. The formalization follows H.S. Wilf’s lecture notes [28] (see also [1]). Euler’s Partition Theorem is listed as item #45 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/ [27].