Constructive Mathematics in St. Petersburg, Russia: a (Somewhat Subjective) View from Within Vladik Kreinovich University of Texas at El Paso, [email protected]
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Sets in Homotopy Type Theory
Predicative topos Sets in Homotopy type theory Bas Spitters Aarhus Bas Spitters Aarhus Sets in Homotopy type theory Predicative topos About me I PhD thesis on constructive analysis I Connecting Bishop's pointwise mathematics w/topos theory (w/Coquand) I Formalization of effective real analysis in Coq O'Connor's PhD part EU ForMath project I Topos theory and quantum theory I Univalent foundations as a combination of the strands co-author of the book and the Coq library I guarded homotopy type theory: applications to CS Bas Spitters Aarhus Sets in Homotopy type theory Most of the presentation is based on the book and Sets in HoTT (with Rijke). CC-BY-SA Towards a new design of proof assistants: Proof assistant with a clear (denotational) semantics, guiding the addition of new features. E.g. guarded cubical type theory Predicative topos Homotopy type theory Towards a new practical foundation for mathematics. I Modern ((higher) categorical) mathematics I Formalization I Constructive mathematics Closer to mathematical practice, inherent treatment of equivalences. Bas Spitters Aarhus Sets in Homotopy type theory Predicative topos Homotopy type theory Towards a new practical foundation for mathematics. I Modern ((higher) categorical) mathematics I Formalization I Constructive mathematics Closer to mathematical practice, inherent treatment of equivalences. Towards a new design of proof assistants: Proof assistant with a clear (denotational) semantics, guiding the addition of new features. E.g. guarded cubical type theory Bas Spitters Aarhus Sets in Homotopy type theory Formalization of discrete mathematics: four color theorem, Feit Thompson, ... computational interpretation was crucial. Can this be extended to non-discrete types? Predicative topos Challenges pre-HoTT: Sets as Types no quotients (setoids), no unique choice (in Coq), .. -
A Taste of Set Theory for Philosophers
Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. A taste of set theory for philosophers Jouko Va¨an¨ anen¨ ∗ Department of Mathematics and Statistics University of Helsinki and Institute for Logic, Language and Computation University of Amsterdam November 17, 2010 Contents 1 Introduction 1 2 Elementary set theory 2 3 Cardinal and ordinal numbers 3 3.1 Equipollence . 4 3.2 Countable sets . 6 3.3 Ordinals . 7 3.4 Cardinals . 8 4 Axiomatic set theory 9 5 Axiom of Choice 12 6 Independence results 13 7 Some recent work 14 7.1 Descriptive Set Theory . 14 7.2 Non well-founded set theory . 14 7.3 Constructive set theory . 15 8 Historical Remarks and Further Reading 15 ∗Research partially supported by grant 40734 of the Academy of Finland and by the EUROCORES LogICCC LINT programme. I Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. 1 Introduction Originally set theory was a theory of infinity, an attempt to understand infinity in ex- act terms. Later it became a universal language for mathematics and an attempt to give a foundation for all of mathematics, and thereby to all sciences that are based on mathematics. -
Categorical Semantics of Constructive Set Theory
Categorical semantics of constructive set theory Beim Fachbereich Mathematik der Technischen Universit¨atDarmstadt eingereichte Habilitationsschrift von Benno van den Berg, PhD aus Emmen, die Niederlande 2 Contents 1 Introduction to the thesis 7 1.1 Logic and metamathematics . 7 1.2 Historical intermezzo . 8 1.3 Constructivity . 9 1.4 Constructive set theory . 11 1.5 Algebraic set theory . 15 1.6 Contents . 17 1.7 Warning concerning terminology . 18 1.8 Acknowledgements . 19 2 A unified approach to algebraic set theory 21 2.1 Introduction . 21 2.2 Constructive set theories . 24 2.3 Categories with small maps . 25 2.3.1 Axioms . 25 2.3.2 Consequences . 29 2.3.3 Strengthenings . 31 2.3.4 Relation to other settings . 32 2.4 Models of set theory . 33 2.5 Examples . 35 2.6 Predicative sheaf theory . 36 2.7 Predicative realizability . 37 3 Exact completion 41 3.1 Introduction . 41 3 4 CONTENTS 3.2 Categories with small maps . 45 3.2.1 Classes of small maps . 46 3.2.2 Classes of display maps . 51 3.3 Axioms for classes of small maps . 55 3.3.1 Representability . 55 3.3.2 Separation . 55 3.3.3 Power types . 55 3.3.4 Function types . 57 3.3.5 Inductive types . 58 3.3.6 Infinity . 60 3.3.7 Fullness . 61 3.4 Exactness and its applications . 63 3.5 Exact completion . 66 3.6 Stability properties of axioms for small maps . 73 3.6.1 Representability . 74 3.6.2 Separation . 74 3.6.3 Power types . -
Constructive Set Theory
CST Book draft Peter Aczel and Michael Rathjen CST Book Draft 2 August 19, 2010 Contents 1 Introduction 7 2 Intuitionistic Logic 9 2.1 Constructivism . 9 2.2 The Brouwer-Heyting-Kolmogorov interpretation . 11 2.3 Counterexamples . 13 2.4 Natural Deductions . 14 2.5 A Hilbert-style system for intuitionistic logic . 17 2.6 Kripke semantics . 19 2.7 Exercises . 21 3 Some Axiom Systems 23 3.1 Classical Set Theory . 23 3.2 Intuitionistic Set Theory . 24 3.3 Basic Constructive Set Theory . 25 3.4 Elementary Constructive Set Theory . 26 3.5 Constructive Zermelo Fraenkel, CZF ................ 26 3.6 On notations for axiom systems. 27 3.7 Class Notation . 27 3.8 Russell's paradox . 28 4 Basic Set constructions in BCST 31 4.1 Ordered Pairs . 31 4.2 More class notation . 32 4.3 The Union-Replacement Scheme . 35 4.4 Exercises . 37 5 From Function Spaces to Powerset 41 5.1 Subset Collection and Exponentiation . 41 5.2 Appendix: Binary Refinement . 44 5.3 Exercises . 45 3 CST Book Draft 6 The Natural Numbers 47 6.1 Some approaches to the natural numbers . 47 6.1.1 Dedekind's characterization of the natural numbers . 47 6.1.2 The Zermelo and von Neumann natural numbers . 48 6.1.3 Lawv`ere'scharacterization of the natural numbers . 48 6.1.4 The Strong Infinity Axiom . 48 6.1.5 Some possible additional axioms concerning ! . 49 6.2 DP-structures and DP-models . 50 6.3 The von Neumann natural numbers in ECST . 51 6.3.1 The DP-model N! ..................... -
Local Constructive Set Theory and Inductive Definitions
Local Constructive Set Theory and Inductive Definitions Peter Aczel 1 Introduction Local Constructive Set Theory (LCST) is intended to be a local version of con- structive set theory (CST). Constructive Set Theory is an open-ended set theoretical setting for constructive mathematics that is not committed to any particular brand of constructive mathematics and, by avoiding any built-in choice principles, is also acceptable in topos mathematics, the mathematics that can be carried out in an arbi- trary topos with a natural numbers object. We refer the reader to [2] for any details, not explained in this paper, concerning CST and the specific CST axiom systems CZF and CZF+ ≡ CZF + REA. CST provides a global set theoretical setting in the sense that there is a single universe of all the mathematical objects that are in the range of the variables. By contrast a local set theory avoids the use of any global universe but instead is formu- lated in a many-sorted language that has various forms of sort including, for each sort α a power-sort Pα, the sort of all sets of elements of sort α. For each sort α there is a binary infix relation ∈α that takes two arguments, the first of sort α and the second of sort Pα. For each formula φ and each variable x of sort α, there is a comprehension term {x : α | φ} of sort Pα for which the following scheme holds. Comprehension: (∀y : α)[ y ∈α {x : α | φ} ↔ φ[y/x] ]. Here we use the notation φ[a/x] for the result of substituting a term a for free oc- curences of the variable x in the formula φ, relabelling bound variables in the stan- dard way to avoid variable clashes. -
Hilbert's 10Th Problem for Solutions in a Subring of Q
Hilbert’s 10th Problem for solutions in a subring of Q Agnieszka Peszek, Apoloniusz Tyszka To cite this version: Agnieszka Peszek, Apoloniusz Tyszka. Hilbert’s 10th Problem for solutions in a subring of Q. Jubilee Congress for the 100th anniversary of the Polish Mathematical Society, Sep 2019, Kraków, Poland. hal-01591775v3 HAL Id: hal-01591775 https://hal.archives-ouvertes.fr/hal-01591775v3 Submitted on 11 Sep 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Hilbert’s 10th Problem for solutions in a subring of Q Agnieszka Peszek, Apoloniusz Tyszka Abstract Yuri Matiyasevich’s theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smorynski’s´ theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H10(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether or not the equation has a solution in R. -
An Outline of Algebraic Set Theory
An Outline of Algebraic Set Theory Steve Awodey Dedicated to Saunders Mac Lane, 1909–2005 Abstract This survey article is intended to introduce the reader to the field of Algebraic Set Theory, in which models of set theory of a new and fascinating kind are determined algebraically. The method is quite robust, admitting adjustment in several respects to model different theories including classical, intuitionistic, bounded, and predicative ones. Under this scheme some familiar set theoretic properties are related to algebraic ones, like freeness, while others result from logical constraints, like definability. The overall theory is complete in two important respects: conventional elementary set theory axiomatizes the class of algebraic models, and the axioms provided for the abstract algebraic framework itself are also complete with respect to a range of natural models consisting of “ideals” of sets, suitably defined. Some previous results involving realizability, forcing, and sheaf models are subsumed, and the prospects for further such unification seem bright. 1 Contents 1 Introduction 3 2 The category of classes 10 2.1 Smallmaps ............................ 12 2.2 Powerclasses............................ 14 2.3 UniversesandInfinity . 15 2.4 Classcategories .......................... 16 2.5 Thetoposofsets ......................... 17 3 Algebraic models of set theory 18 3.1 ThesettheoryBIST ....................... 18 3.2 Algebraic soundness of BIST . 20 3.3 Algebraic completeness of BIST . 21 4 Classes as ideals of sets 23 4.1 Smallmapsandideals . .. .. 24 4.2 Powerclasses and universes . 26 4.3 Conservativity........................... 29 5 Ideal models 29 5.1 Freealgebras ........................... 29 5.2 Collection ............................. 30 5.3 Idealcompleteness . .. .. 32 6 Variations 33 References 36 2 1 Introduction Algebraic set theory (AST) is a new approach to the construction of models of set theory, invented by Andr´eJoyal and Ieke Moerdijk and first presented in [16]. -
A Meaning Explanation for Hott∗
CORE Metadata, citation and similar papers at core.ac.uk Provided by Philsci-Archive A Meaning Explanation for HoTT∗ Dimitris Tsementzis February 15, 2017 Abstract The Univalent Foundations (UF) offer a new picture of the foundations of mathematics largely independent from set theory. In this paper I will focus on the question of whether Homotopy Type Theory (HoTT) (as a formalization of UF) can be justified intuitively as a theory of shapes in the same way that ZFC (as a formalization of set-theoretic foundations) can be justified intuitively as a theory of collections. I first clarify what I mean by an “intuitive justification” by distinguishing between formal and pre- formal “meaning explanations” in the vein of Martin-Löf. I then explain why Martin-Löf’s original meaning explanation for type theory no longer applies to HoTT. Finally, I outline a pre-formal meaning explanation for HoTT based on spatial notions like “shape”, “path”, “point” etc. which in particular provides an intuitive justification of the axiom of univalence. I conclude by discussing the limitations and prospects of such a project. Introduction The Univalent Foundations (UF) is a new proposal for the foundations of math- ematics that lies outside the spectrum of Cantorian foundations.1 UF takes as its intended semantics the universe of ∞-groupoids (or homotopy types). It does so in terms of formal theories called Homotopy Type Theories (HoTT(s)). These are usually phrased in terms of some formal dependent type theory in the style of Martin-Löf. For example, the “standard” HoTT in [34] is given by intensional Martin-Löf Type Theory with some extra assumptions (the axiom of univalence and certain higher inductive types). -
Formalizing Abstract Algebra in Constructive Set Theory
Formalizing Abstract Algebra in Constructive Set Theory Xin Yu and Jason J. Hickey California Institute of Technology, Pasadena, CA 91125, USA Abstract. We present a machine-checked formalization of elementary abstract algebra in constructive set theory. Our formalization uses an approach where we start by specifying the group axioms as a collection of inference rules, defining a logic for groups. Then we can tell whether a given set with a binary operation is a group or not, and derive all properties of groups constructively from these inference rules as well as the axioms of the set theory. The formalization of all other concepts in abstract algebra is based on that of the group. We give an example of a formalization of a concrete group, the Klein 4-group. 1 Introduction In this paper, we study abstract algebra in a formal, automated system where proofs can be mechanically generated and verified. Currently most efforts of formalizing algebra using general purpose theorem provers are grounded in type theory. For example, Gunter working with HOL [1] has shown the integers mod n to be an implementation of abstract groups [2]. Jackson has implemented computational abstract algebra in NuPRL [3, 4]. In IMPS [5] there is a notion of little theories [6] which they use for proving theorems about groups and rings. In Coq [7], a (constructive) algebraic hierarchy of groups, rings, fields, etc. has been defined and a constructive proof of the Fundamental Theorem of Algebra was formalized under it [8]. In Isabelle [9] HOL, Kamm¨uller and Paulson formalized group theory and proved the Sylow theorem [10]. -
Cristian S. Calude Curriculum Vitæ: August 6, 2021
Cristian S. Calude Curriculum Vitæ: August 6, 2021 Contents 1 Personal Data 2 2 Education 2 3 Work Experience1 2 3.1 Academic Positions...............................................2 3.2 Research Positions...............................................3 3.3 Visiting Positions................................................3 3.4 Expert......................................................4 3.5 Other Positions.................................................5 4 Research2 5 4.1 Papers in Refereed Journals..........................................5 4.2 Papers in Refereed Conference Proceedings................................. 14 4.3 Papers in Refereed Collective Books..................................... 18 4.4 Monographs................................................... 20 4.5 Popular Books................................................. 21 4.6 Edited Books.................................................. 21 4.7 Edited Special Issues of Journals....................................... 23 4.8 Research Reports............................................... 25 4.9 Refereed Abstracts............................................... 33 4.10 Miscellanea Papers and Reviews....................................... 35 4.11 Research Grants................................................ 40 4.12 Lectures at Conferences (Some Invited)................................... 42 4.13 Invited Seminar Presentations......................................... 49 4.14 Post-Doctoral Fellows............................................. 57 4.15 Research Seminars.............................................. -
Mathematical Events of the Twentieth Century Mathematical Events of the Twentieth Century
Mathematical Events of the Twentieth Century Mathematical Events of the Twentieth Century Edited by A. A. Bolibruch, Yu.S. Osipov, and Ya.G. Sinai 123 PHASIS † A. A. Bolibruch Ya . G . S i n a i University of Princeton Yu. S. Osipov Department of Mathematics Academy of Sciences Washington Road Leninsky Pr. 14 08544-1000 Princeton, USA 117901 Moscow, Russia e-mail: [email protected] e-mail: [email protected] Editorial Board: V.I. Arnold A. A. Bolibruch (Vice-Chair) A. M. Vershik Yu. I. Manin Yu. S. Osipov (Chair) Ya. G. Sinai (Vice-Chair) V. M . Ti k h o m i rov L. D. Faddeev V.B. Philippov (Secretary) Originally published in Russian as “Matematicheskie sobytiya XX veka” by PHASIS, Moscow, Russia 2003 (ISBN 5-7036-0074-X). Library of Congress Control Number: 2005931922 Mathematics Subject Classification (2000): 01A60 ISBN-10 3-540-23235-4 Springer Berlin Heidelberg New York ISBN-13 978-3-540-23235-3 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broad- casting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springeronline.com © Springer-Verlag Berlin Heidelberg and PHASIS Moscow 2006 Printed in Germany The use of general descriptive names, registered names, trademarks, etc. -
Interview with George Csicsery
Interview with George Csicsery George Csicsery is the producer and director of the film Julia Robinson and Hilbert’s Tenth Problem (see movie review, pages 573–575, this issue). The following is an interview with Csicsery, conducted on February 19, 2008, by Notices graphics editor Bill Casselman, University of British Columbia. Notices: How did you come to make this film? you consider that she had already written, or co- Csicsery: The idea for this film came in 1998. written, Julia Robinson’s autobiography, Julia: A Charlie Silver, a logician and a friend, sent me an Life in Mathematics. email in which he summarized the idea of the film My main conceptual contribution was to tell for me in a few enthusiastic paragraphs, beginning the mathematical story inside the biography of with “While waking up this morning, I had a flash Julia Robinson. And this proved to be the most of a math film … .” In the rest of his email he out- difficult part—making the two parts move forward lined much of what eventually went into the film. in tandem so that neither would subtract from Charlie had helped me a great deal while I was the other. making N is a Number: A Portrait of Paul Erd˝so , Notices: How did you get interested in making mathematics films in general? Csicsery: That’s a question I get often, since I’m not a mathematician and my understanding of mathematical ideas is rather primitive. Just as often, my official answer is that I’m a refugee from the social sciences looking for terra firma.