An Overview of Saharon Shelah's Contributions to Mathematical Logic, in Particular to Model Theory
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
An Invitation to Model-Theoretic Galois Theory
AN INVITATION TO MODEL-THEORETIC GALOIS THEORY. ALICE MEDVEDEV AND RAMIN TAKLOO-BIGHASH Abstract. We carry out some of Galois’ work in the setting of an arbitrary first-order theory T . We replace the ambient algebraically closed field by a large model M of T , replace fields by definably closed subsets of M, assume that T codes finite sets, and obtain the fundamental duality of Galois theory matching subgroups of the Galois group of L over F with intermediate exten- sions F ≤ K ≤ L. This exposition of a special case of [11] has the advantage of requiring almost no background beyond familiarity with fields, polynomials, first-order formulae, and automorphisms. 1. Introduction. Two hundred years ago, Evariste´ Galois contemplated symmetry groups of so- lutions of polynomial equations, and Galois theory was born. Thirty years ago, Saharon Shelah found it necessary to work with theories that eliminate imaginar- ies; for an arbitrary theory, he constructed a canonical definitional expansion with this property in [16]. Poizat immediately recognized the importance of a theory already having this property in its native language; indeed, he defined “elimina- tion of imaginaries” in [11]. It immediately became clear (see [11]) that much of Galois theory can be developed for an arbitrary first-order theory that eliminates imaginaries. This model-theoretic version of Galois theory can be generalized be- yond finite or even infinite algebraic extensions, and this can in turn be useful in other algebraic settings such as the study of Galois groups of polynomial differential equations (already begun in [11]) and linear difference equations. On a less applied note, it is possible to bring further ideas into the model-theoretic setting, as is done in [10] for the relation between Galois cohomology and homogeneous spaces. -
Martin's Maximum and Weak Square
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000{000 S 0002-9939(XX)0000-0 MARTIN'S MAXIMUM AND WEAK SQUARE JAMES CUMMINGS AND MENACHEM MAGIDOR (Communicated by Julia Knight) Abstract. We analyse the influence of the forcing axiom Martin's Maximum on the existence of square sequences, with a focus on the weak square principle λ,µ. 1. Introduction It is well known that strong forcing axioms (for example PFA, MM) and strong large cardinal axioms (strongly compact, supercompact) exert rather similar kinds of influence on the combinatorics of infinite cardinals. This is perhaps not so sur- prising when we consider the widely held belief that essentially the only way to obtain a model of PFA or MM is to collapse a supercompact cardinal to become !2. We quote a few results which bring out the similarities: 1a) (Solovay [14]) If κ is supercompact then λ fails for all λ ≥ κ. 1b) (Todorˇcevi´c[15]) If PFA holds then λ fails for all λ ≥ !2. ∗ 2a) (Shelah [11]) If κ is supercompact then λ fails for all λ such that cf(λ) < κ < λ. ∗ 2b) (Magidor, see Theorem 1.2) If MM holds then λ fails for all λ such that cf(λ) = !. 3a) (Solovay [13]) If κ is supercompact then SCH holds at all singular cardinals greater than κ. 3b) (Foreman, Magidor and Shelah [7]) If MM holds then SCH holds. 3c) (Viale [16]) If PFA holds then SCH holds. In fact both the p-ideal di- chotomy and the mapping reflection principle (which are well known con- sequences of PFA) suffice to prove SCH. -
Prizes and Awards Session
PRIZES AND AWARDS SESSION Wednesday, July 12, 2021 9:00 AM EDT 2021 SIAM Annual Meeting July 19 – 23, 2021 Held in Virtual Format 1 Table of Contents AWM-SIAM Sonia Kovalevsky Lecture ................................................................................................... 3 George B. Dantzig Prize ............................................................................................................................. 5 George Pólya Prize for Mathematical Exposition .................................................................................... 7 George Pólya Prize in Applied Combinatorics ......................................................................................... 8 I.E. Block Community Lecture .................................................................................................................. 9 John von Neumann Prize ......................................................................................................................... 11 Lagrange Prize in Continuous Optimization .......................................................................................... 13 Ralph E. Kleinman Prize .......................................................................................................................... 15 SIAM Prize for Distinguished Service to the Profession ....................................................................... 17 SIAM Student Paper Prizes .................................................................................................................... -
A Cardinal Preserving Extension Making the Set of Points of Countable V Cofinality Nonstationary
A CARDINAL PRESERVING EXTENSION MAKING THE SET OF POINTS OF COUNTABLE V COFINALITY NONSTATIONARY MOTI GITIK, ITAY NEEMAN, AND DIMA SINAPOVA Abstract. Assuming large cardinals we produce a forcing extension of V which preserves cardinals, does not add reals, and makes the set of points of countable V cofinality in κ+ nonstationary. Continuing to force further, we obtain an extension in which the set of points of countable V cofinality in ν is nonstationary for every regular ν ≥ κ+. Finally we show that our large cardinal assumption is optimal. The results in this paper were inspired by the following question, posed in a preprint (http://arxiv.org/abs/math/0509633v1, 27 September 2005) to the paper Viale [9]: Suppose V ⊂ W and V and W have the same cardinals and the same reals. Can it be shown, in ZFC alone, that for every cardinal κ, there is in V a <ω + partition {As | s ∈ κ } of the points of κ of countable V cofinality, into disjoint sets which are stationary in W ? In this paper we show that under some assumptions on κ there is a reals and cardinal preserving generic extension W which satisfies that the set of points of κ+ of countable V cofinality is nonstationary. In particular, a partition as above cannot be found for each κ. Continuing to force further, we produce a reals and cardinal preserving extension in which the set of points of λ of countable V cofinality is nonstationary for every regular λ ≥ κ+. All this is done under the large cardinal assumption that for each α<κ there exists θ<κ with Mitchell order at least α. -
On a Generalization of the Hadwiger-Nelson Problem
On a generalization of the Hadwiger-Nelson problem Mohammad Bardestani, Keivan Mallahi-Karai October 15, 2018 Abstract For a field F and a quadratic form Q defined on an n-dimensional vector space V over F , let QGQ, called the quadratic graph associated to Q, be the graph with the vertex set V where vertices u; w 2 V form an edge if and only if Q(v − w) = 1. Quadratic graphs can be viewed as natural generalizations of the unit-distance graph featuring in the famous Hadwiger-Nelson problem. In the present paper, we will prove that for a local field F of characteristic zero, the Borel chromatic number of QGQ is infinite if and only if Q represents zero non-trivially over F . The proof employs a recent spectral bound for the Borel chromatic number of Cayley graphs, combined with an analysis of certain oscillatory integrals over local fields. As an application, we will also answer a variant of question 525 proposed in the 22nd British Combinatorics Conference 2009 [6]. 1 Introduction The celebrated Hadwiger-Nelson problem asks for the minimum number of colors required to color n R such that no two points at distance one from each other have the same color. Recall that the chromatic number of a graph G, denoted by χ(G), is the least cardinal c such that the vertices of G can be partitioned into c sets (called color classes) such that no color class contains an edge in G. Hence, the Hadwiger-Nelson problem is the question of finding χ(Gn), where Gn is the graph with vertex set n V (Gn) = R , where the adjacency of vertices x; y 2 V (Gn) is defined by the equation Q(x − y) = 1; 2 2 n here, Q(x1; : : : ; xn) = x1 + ··· + xn is the canonical positive-definite quadratic form on R . -
Letter from the President
Letter from the President Dear EATCS members, As usual this time of the year, I have the great pleasure to announce the assignments of this year’s Gódel Prize, EATCS Award and Presburger Award. The Gödel Prize 2012, which is co-sponsored by EATCS and ACM SIGACT, has been awarded jointly to Elias Koutsoupias, Christos H. Papadimitriou, Tim Roughgarden, Éva Tardos, Noam Nisan and Amir Ronen. In particular, the prize has been awarded to Elias Koutsoupias and Christos H. Papadimitriou for their paper Worst-case equilibria, Computer Science Review, 3(2): 65-69, 2009; to Tim Roughgarden and Éva Tardos for their paper How Bad Is Selfish Routing? , Journal of the ACM, 49(2): 236-259, 2002; and to Noam Nisan and Amir Ronen for their paper Algorithmic Mechanism Design, Games and Economic Behavior, 35: 166-196, 2001. As you can read in the laudation published in this issue of the bulletin, these three papers contributed highly influential concepts and results that laid the foundation for an explosive growth in algorithmic game theory, a trans-disciplinary combination of the theory of algorithms and the theory of games that has greatly enriched both fields. The purpose of all three papers was to improve our understanding of how the internet and other complex computational systems behave when users and service providers in these systems act selfishly. On behalf of this year’s Gödel Prize Committee (consisting of Sanjeev Arora, Josep Díaz, Giuseppe F. Italiano, Daniel ✸ ❇❊❆❚❈❙ ♥♦ ✶✵✼ ❊❆❚❈❙ ▼❆❚❚❊❘❙ Spielman, Eli Upfal and Mogens Nielsen as chair) and the whole EATCS community I would like to offer our congratulations and deep respect to all of the six winners! The EATCS Award 2012 has been granted to Moshe Vardi for his decisive influence on the development of theoretical computer science, for his pre-eminent career as a distinguished researcher, and for his role as a most illustrious leader and disseminator. -
A Framework for Forcing Constructions at Successors of Singular Cardinals
A FRAMEWORK FOR FORCING CONSTRUCTIONS AT SUCCESSORS OF SINGULAR CARDINALS JAMES CUMMINGS, MIRNA DAMONJA, MENACHEM MAGIDOR, CHARLES MORGAN, AND SAHARON SHELAH Abstract. We describe a framework for proving consistency re- sults about singular cardinals of arbitrary conality and their suc- cessors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular cardinal κ of uncountable conality, while κ+ enjoys various combinatorial prop- erties. As a sample application, we prove the consistency (relative to that of ZFC plus a supercompact cardinal) of there being a strong limit singular cardinal κ of uncountable conality where SCH fails + and such that there is a collection of size less than 2κ of graphs on κ+ such that any graph on κ+ embeds into one of the graphs in the collection. Introduction The class of uncountable regular cardinals is naturally divided into three disjoint classes: the successors of regular cardinals, the successors of singular cardinals and the weakly inaccessible cardinals. When we 2010 Mathematics Subject Classication. Primary: 03E35, 03E55, 03E75. Key words and phrases. successor of singular, Radin forcing, forcing axiom, uni- versal graph. Cummings thanks the National Science Foundation for their support through grant DMS-1101156. Cummings, Dºamonja and Morgan thank the Institut Henri Poincaré for their support through the Research in Paris program during the period 24-29 June 2013. Dºamonja, Magidor and Shelah thank the Mittag-Leer Institute for their sup- port during the month of September 2009. Mirna Dºamonja thanks EPSRC for their support through their grants EP/G068720 and EP/I00498. Morgan thanks EPSRC for their support through grant EP/I00498. -
Arxiv:1704.03853V4
TAME STRUCTURES VIA CHARACTER SUMS OVER FINITE FIELDS CHIEU-MINH TRAN Abstract. We show that the theory of algebraically closed fields with mul- tiplicative circular orders has a model companion ACFO. Using number- theoretic results on character sums over finite fields, we show that if F is an algebraic closure of a finite field, and ◁ is any translation-invariant circular order on the multiplicative group F×, then (F, ◁) is a model of ACFO. Our re- sults can be regarded as analogues of Ax’s results in [1] which utilize counting points over finite fields. 1. Introduction Throughout, F will be an algebraic closure of a finite field. We are interested in the following question: Are there natural expansions of F by order-type relations which are also model-theoretically tame? There is no known order-type relation on F which interacts in a sensible way with both addition and multiplication. This is in stark contrast to the situation with the field C of complex numbers where addition and multiplication are compatible with the Euclidean metric induced by the natural order on R. It is not hard to see the reason: the additive group of F is an infinite torsion group of finite exponent, so even finding an additively compatible order-type relation seems unlikely. On the other hand, the multiplicative group F× is a union of cyclic groups, so it is fairly natural to consider circular orders ◁ on F× which are compatible with the multiplicative structure. In this paper, we will show that the resulting structures (F, ◁) give a positive answer to some aspects of the above question. -
UOLUME 49 Contemporary MATHEMATICS
Complex Differential Geometry and Nonlinear Differential Equations Proceedings of a Summer Research Conference held August12-18,1984 AMERICAn MATHEMATICAL SOCIETY UOLUME 49 http://dx.doi.org/10.1090/conm/049 COnTEMPORARY MATHEMATICS Titles in This Series Volume 1 Markov random fields and their 15 Advanced analytic number theory. applications, Ross Kindermann and Part 1: Ramification theoretic J. Laurie Snell methods. Carlos J. Moreno 2 Proceedings of the conference 16 Complex representations of on integration. topology, and GL(2. K) for finite fields K, geometry in linear spaces. llya Piatetski-Shapiro William H. Graves. Editor 17 Nonlinear partial differential 3 The closed graph and P-closed equations, Joel A. Smoller. Editor graph properties in general topology, T. R. Hamlett and 18 Fixed points and nonexpansive L. L. Herrington mappings, Robert C. Sine. Editor 4 Problems of elastic stability and 19 Proceedings of the Northwestern vibrations, Vadim Komkov. Editor homotopy theory conference. 5 Rational constructions of Haynes R. Miller and Stewart B. modules for simple Lie algebras. Priddy, Editors George B. Seligman 20 Low dimensional topology, 6 Umbral calculus and Hopf algebras, Samuel J. Lomonaco. Jr.. Editor Robert Morris. Editor 21 Topological methods in nonlinear 7 Complex contour integral functional analysis, S. P. Singh. representation of cardinal spline S. Thomeier. and B. Watson. Editors functions, Walter Schempp 22 Factorizations of b" 1, b 8 Ordered fields and real algebraic ± = 2, 3, 5, 6, 7, 10,11,12 up to high geometry, D. W. Dubois and powers. John Brillhart. D. H. Lehmer. T. Recio. Editors J. L. Selfridge. Bryant Tuckerman. and 9 Papers in algebra. -
A NEW L¨OWENHEIM-SKOLEM THEOREM 1. Introduction The
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 357, Number 5, Pages 1693–1715 S 0002-9947(04)03445-2 Article electronically published on December 16, 2004 ANEWLOWENHEIM-SKOLEM¨ THEOREM MATTHEW FOREMAN AND STEVO TODORCEVIC Abstract. This paper establishes a refinement of the classical L¨owenheim- Skolem theorem. The main result shows that any first order structure has a countable elementary substructure with strong second order properties. Sev- eral consequences for Singular Cardinals Combinatorics are deduced from this. 1. Introduction The L¨owenheim-Skolem Theorem [21] is one of the classical and formative results of first order logic. Its consequences have been important technically in the devel- opment of Model Theory, Set Theory and interesting from the point of view of the Philosophy of Mathematics [16]. In this paper we improve the L¨owenheim-Skolem Theorem and deduce important combinatorial consequences from the stronger ver- sion. There have been many attempts to improve and generalize properties of first order logic to stronger logics. The literature is much too large to survey here. One property that defines first order logic is the fact that every infinite structure in a countable language has a countable elementary substructure. This is not true of many stronger logics such as second order logic. In particular, in the classical L¨owenheim-Skolem theorem, one has no control over the second order properties of the elementary substructure. In this paper we prove that if one fixes in advance a collection of “intervals” around each point in a particular domain κ (e.g. a club guessing ladder system), then for all real numbers r and all structures A with domain κ, there is a countable elementary substructure of A that has non-empty intersection with exactly those intervals specified by r. -
Justin Clarke-Doane Department of Philosophy Columbia University 708 Philosophy Hall, MC: 4971 1150 Amsterdam Avenue New York, New York 10027 [email protected]
Justin Clarke-Doane Department of Philosophy Columbia University 708 Philosophy Hall, MC: 4971 1150 Amsterdam Avenue New York, New York 10027 [email protected] Primary Appointment 2021 – Present Associate Professor with tenure, Columbia University, USA Other Appointments 2014 – Present Honorary Research Fellow, University of Birmingham, UK 2013 – Present Adjunct Research Associate, Monash University, Australia Visiting Appointments June 2015 Visiting Professor, Renmin University of China (RUC) October 2012 Visiting Scholar, Institute for the History and Philosophy of Science and Technology (IHPST), Université Paris 1 Panthéon-Sorbonne Previous Appointments 2019 – 2021 Associate Professor, Columbia University, USA 2014 – 2019 Assistant Professor, Columbia University, USA 2013 – 2014 Birmingham Research Fellow (permanent), University of Birmingham 2011 – 2013 Lecturer (fixed-term), Monash University Education 2005 – 2011 Ph.D. Philosophy, New York University (NYU) Dissertation: Morality and Mathematics Committee: Hartry Field (Advisor), Thomas Nagel, Derek Parfit, Stephen Schiffer 1 2001 – 2005 B.A., Philosophy/Mathematics, New College of Florida (the honors college of the state university system of Florida) Thesis: Attribute-Identification in Mathematics Committee: Aron Edidin (Advisor), Karsten Henckell, Douglas Langston Areas of Research Metaethics, Metaphysics, Epistemology, Philosophy of Logic & Mathematics Areas of Competence Normative & Applied Ethics, Philosophy of Mind, Philosophy of Physics, Logic & Set Theory Honors and Awards 2020 Morality and Mathematics chosen for symposia at Philosophy and Phenomenological Research and Analysis. 2019 Lavine Scholar 2017 Chamberlain Fellowship 2015 “Moral Epistemology: The Mathematics Analogy” selected by Philosopher’s Annual as one of the “tenbest articles published in philosophy in 2014”. 2015 “Moral Epistemology: The Mathematics Analogy” selected as a “Notable Writing” in The Best Writing on Mathematics 2015. -
Pointers to Truth Author(S): Haim Gaifman Reviewed Work(S): Source: the Journal of Philosophy, Vol
Journal of Philosophy, Inc. Pointers to Truth Author(s): Haim Gaifman Reviewed work(s): Source: The Journal of Philosophy, Vol. 89, No. 5 (May, 1992), pp. 223-261 Published by: Journal of Philosophy, Inc. Stable URL: http://www.jstor.org/stable/2027167 . Accessed: 09/01/2012 10:03 Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Journal of Philosophy, Inc. is collaborating with JSTOR to digitize, preserve and extend access to The Journal of Philosophy. http://www.jstor.org +- * -+ THE JOURNAL OF PHILOSOPHY VOLUME LXXXIX, NO. 5, MAY 1992 POINTERS TO TRUTH* C onsider the following: Jack: What I am saying at this very moment is nonsense. Jill: Yes, what you have just said is nonsense. Apparently, Jack spoke nonsense and Jill spoke to the point. But Jack and Jill seem to have asserted the same thing: that Jack spoke nonsense. Wherefore the difference? To avoid the vagueness and the conflicting intuitions that go with 'nonsense', let us replace it by 'not true' and recast the puzzle as follows: line 1: The sentence on line 1 is not true. line 2: The sentence on line 1 is not true.