Search
Recent seminar announcements
 CMU math logic seminar Tue Mar 21, Bartošová on “Freedom of action in combinatorial terms” Carnegie Mellon Logic Seminar
 Andres Caicedo: MRP and squares, II Michigan Logic Seminar
 David Aspero: Generic absoluteness for Chang models Bristol Logic Seminar
 Andres Caicedo: MRP and squares Michigan Logic Seminar
 Piotr Szewczak: The Scheepers property and products of Menger spaces Wrocław University of Technology
 Peter Holy: A Hierarchy of Ramsey cardinals Bristol Logic Seminar
 Marcin Sabok: Hyperfiniteness of boundary actions of cubulated hyperbolic groups Toronto Set Theory Seminar
 Rick Statman: Backus FP is Turing complete Carnegie Mellon Logic Seminar
 Deirdre Haskell: Using model theory to find upper bounds on VC density Carnegie Mellon Logic Seminar
 Sergio GarciaBalan: On star selection principles Toronto Set Theory Seminar
Upcoming conferences
 April 1: MAMLS at VCU, April 12, 2017
 May 5: Noncommutative Geometry and Operator Algebras, Nashville, May 511, 2017
 July 3: 6th European Set Theory Conference, Budapest, July 37, 2017
 July 10: 10th Young Set Theory Workshop, Edinburgh, July 1014, 2017
 August 2: A conference on the occasion of Jensen’s 80th birthday, Münster, Aug 02–Aug 04, 2017
 August 14: Logic Colloquium 2017, August 1420, 2017
 August 20: Frontiers of Selection Principles, Warsaw, Aug 20 – Sep 1, 2017

Talks by venue
 Barcelona Set Theory Seminar (RSS)
 Boise Set Theory Seminar (RSS)
 Bonn Logic Seminar (RSS)
 Bristol Logic Seminar (RSS)
 Carnegie Mellon Logic Seminar (RSS)
 Dartmouth Logic Seminar (RSS)
 Israeli Logic Talks (RSS)
 Michigan Logic Seminar (RSS)
 Morelia Topology and Set Theory Seminar (RSS)
 New York Logic Seminars (RSS)
 NUS logic seminar (RSS)
 Prague Forcing Seminar (RSS)
 Prague Set Theory Seminar (RSS)
 Rutgers Logic Seminar (RSS)
 Toronto Set Theory Seminar (RSS)
 UC Irvine Set Theory Seminar (RSS)
 Wroclaw Set Theory Seminar (RSS)
 Wrocław University of Technology (RSS)
Talks by speaker
A.R.D. Mathias Alan Dow Alekos Kechris Aleksandra Kwiatkowska Alex Usvyatsov Alexei Kolesnikov Andre Nies Andreas Blass Andrés Caicedo Andrew BrookeTaylor Andrew Marks Andrew Toms Andy Zucker Antonio Avilés Anush Tserunyan Ari Brodsky Arnie Miller Arthur Apter Asaf Karagila Asger Tornquist Ashutosh Kumar Assaf Hasson Assaf Rinot Barnabas Farkas Benjamin Miller Bill Chen Bill Mitchell Boban Velickovic Boris Zilber Borisa Kuzeljevic Brent Cody Burak Kaya Carlos Di Prisco Carlos MartinezRanero Charles Morgan Chris LambieHanson Christina Brech Clinton Conley Daisuke Ikegami Damian Sobota Dana Bartošová Daniel Rodriguez Daniel Soukup David Aspero David Chodounsky David Fernández Bretón David J. Fernández Bretón David Marker David Milovich Diana Ojeda Diego Alejandro Mejia Dikran Dikranjan Dilip Raghavan Dima Sinapova Dimitrios Vlitas Egbert Thümmel Erez Shochat Erin Carmody Frank Stephan Franklin Tall Gregory Cherlin Grigor Sargsyan Grzegorz Plebanek Gunter Fuchs Heike Mildenberger Hiroshi Sakai Hugh Woodin Ilijas Farah Ioannis Souldatos Isaac Goldbring István Juhász Itay Neeman James Cummings Jan Grebík Jan Stary Jan van Mill Jay Williams Jean Larson Jindra Zapletal Joan Bagaria Joel David Hamkins John Baldwin John Clemens John Krueger John Steel Jonathan Verner Jordi LopezAbad Jörg Brendle Jose Iovino Jouko Väänänen Julien Melleray Juliette Kennedy Juris Steprans Justin Moore K. P. Hart Kaethe Minden Konstantinos Tyros Lajos Soukup Laura Fontanella Liljana Babinkostova Lionel Nguyen Van The Liuzhen Wu Luca Motto Ros Luz María García Ávila Lynn Scow Lyubomyr Zdomskyy Marcin Michalski Marcin Sabok Marion Scheepers Martin Goldstern Martin Zeman Martino Lupini Maryanthe Malliaris Masaru Kada Mati Rubin Matteo Viale Matthew D. Foreman Melvin Fitting Menachem Kojman Menachem Magidor Merlin Carl Michael Hrusak Michal Doucha Miguel Angel Mota Mike Pawliuk Mikhail Tkachenko Miodrag Sokic Mirna Džamonja Miyamoto Tadatoshi Monroe Eskew Moti Gitik Nadav Meir Nam Trang Natasha Dobrinen Norman Perlmutter Omer Ben Neria Osvaldo Guzman Osvaldo Guzmán González Paul Larson Paul McKenney Peng Yinhe Peter Holy Peter Koellner Peter Koepke Peter Komjath Peter Krautzberger Petr Simon Philip Welch Philipp Lücke Philipp Schlicht Piotr BorodulinNadzieja Piotr Koszmider Ralf Schindler Randall Holmes Rick Statman Robert Ralowski Robin TuckerDrob Rodrigo R. Dias Roman Kossak Saharon Shelah Sakaé Fuchino Salma Kuhlmann Samuel Coskey Scott Cramer Scott Schneider Sean Cox Sebastien Vasey Sergei Artemov Shehzad Ahmed Sheila Miller Simon Thomas Slawomir Solecki Spencer Breiner Spencer Unger Stefan Geschke Stevo Todorcevic Su Gao Sy David Friedman Szymon Zeberski Teruyuki Yorioka Thilo Weinert Thomas Johnstone Todd Eisworth Todor Tsankov Tomek Bartoszynski Toshimichi Usuba Trevor Wilson Uri Abraham Vera Fischer Victor Torres Perez Victoria Gitman Vincenzo Dimonte Wieslaw Kubis Will Boney Wojciech Stadnicki Wolfgang Wohofsky Xianghui Shi Yair Hayut Yizheng Zhu Yurii KhomskiiCategories
Recent discussions
 10th Young Set Theory Workshop, Edinburgh, July 1014, 2017  Set Theory Talks on 6th Young Set Theory Workshop, June 1014, 2013
 10th Young Set Theory Workshop, Edinburgh, July 1014, 2017  Set Theory Talks on 9th Young Set Theory Workshop, Copenhagen, June 1317, 2016
 10th Young Set Theory Workshop, Edinburgh, July 1014, 2017  Set Theory Talks on 8th Young Set Theory Workshop, Jerusalem, October 2530, 2015
 1st Irvine Conference on Descriptive Inner Model Theory and HOD Mice, July 1829 2016  Set Theory Talks on Inner Model Theory events in California, June, 2014
 saf on Assaf Rinot: The strength of the generalized Souslin hypothesis
 10th Young Set Theory Workshop, Edinburgh, July 1014, 2017  Set Theory Talks on 6th Young Set Theory Workshop, June 1014, 2013
Seminar organizer’s toolbox
Archives of: Carnegie Mellon Logic Seminar
CMU math logic seminar Tue Mar 21, Bartošová on “Freedom of action in combinatorial terms”
Posted in Seminars
Rick Statman: Backus FP is Turing complete
Mathematical logic seminar – Feb 28 2017
Time: 3:30pm – 4:30 pm
Room: Wean Hall 8220
Speaker: Rick Statman
Department of Mathematical Sciences
CMU
Title: Backus FP is Turing complete
Abstract:
Cartesian monoids are rather simple algebraic structures of which you know many examples. They also travel under many assumed names such as Cantor algebras, JonssonTarski algebras, and FreydHeller monoids. John Backus’s FP is just the theory of Cartesian monoids together with fixed points for all Cartesian monoid polynomials.
In his 1977 Turing Award address, John Backus introduced the model of functional programming called “FP”. FP is a descendant of the HerbrandGodel notion of recursive definablity and the ancestor of the programming language Haskell. One reason that FP is attractive is that it provides “an algebra of functional programs”. However, Backus did not believe that basic FP was powerful enough;
“FP systems have a number of limitations….. If the set of primitive functions and functional forms is weak, it may not be able to express every computable function”. John Backus, 1977 ACM Turing award lecture.
and he moved on to stronger systems. It turns out that, in this respect, Backus was mistaken. Here we shall show that FP can compute every partial recursive function.
Deirdre Haskell: Using model theory to find upper bounds on VC density
Mathematical logic seminar – Feb 21 2017
Time: 3:30pm – 4:30 pm
Room: Wean Hall 8220
Speaker: Deirdre Haskell
Department of Mathematics and Statistics
McMaster University
Title: Using model theory to find upper bounds on VC density
Abstract:
The VC dimension of a collection of sets is a concept used in probability and learning theory. It is closely related to the modeltheoretic concept of the independence property. In this talk, I will illustrate these concepts in various examples, and show how the modeltheoretic approach can give some bounds on VC density.
Andy Zucker: An ultrafilter proof of the 2dimensional HalpernLaüchli Theorem
Mathematical logic seminar – Jan 31 2017
Time: 3:30pm – 4:30 pm
Room: Wean Hall 8220
Speaker: Andy Zucker
Department of Mathematical Sciences
CMU
Title: An ultrafilter proof of the 2dimensional HalpernLaüchli Theorem
Abstract:
We will discuss the HalpernLaüchli Theorem and provide a new proof in dimension 2. The idea is to use an ultrafilter on ω to turn combinatorics on trees into combinatorics on the branches, that is Cantor space. Time permitting, we will discuss obstacles to generalizing the proof to higher dimensions.
James Cummings: Universal graphs
Mathematical logic seminar – Jan 24 2017
Time: 3:30pm – 4:30 pm
Time: 3:30pm – 4:30 pm
Room: Wean Hall 8220
Speaker: James Cummings
Department of Mathematical Sciences
CMU
Title: Universal graphs
Abstract:
The wellknown “random countable graph” or “Rado graph” is a countable graph which contains induced copies of every countable graph. We discuss the existence of such objects in uncountable cardinalities.
Andy Zucker: Ramsey degrees big and small II
Mathematical logic seminar – November 29 2016
Time: 3:30pm – 4:30 pm
Room: Wean Hall 8220
Speaker: Andy Zucker
Department of Mathematical Sciences
CMU
Title: Ramsey degrees big and small II
Abstract:
We will consider various aspects of structural Ramsey theory in a countable firstorder structure, leading to an investigation of several notions of largeness. For ultrahomogeneous (i.e. Fraisse) structures, the Ramsey theoretic properties of the structure and the dynamical properties of the automorphism group are closely related. This talk should serve as an introduction to the KechrisPestovTodorčević correspondence while also discussing directions for new research.
Andy Zucker : Ramsey degrees big and small
Mathematical logic seminar – November 15 2016
Time: 3:30pm – 4:30 pm
Room: Wean Hall 8220
Speaker: Andy Zucker
Department of Mathematical Sciences
CMU
Title: Ramsey degrees big and small
Abstract:
We will consider various aspects of structural Ramsey theory in a countable firstorder structure, leading to an investigation of several notions of largeness. For ultrahomogeneous (i.e. Fraisse) structures, the Ramsey theoretic properties of the structure and the dynamical properties of the automorphism group are closely related. This talk should serve as an introduction to the KechrisPestovTodorčević correspondence while also discussing directions for new research.
Appalachian Set Theory workshop: Benjamin Miller, January 21, 2017
Saturday, January 21, 2017
9:30 a.m. – 6 p.m. with coffee and lunch breaks
Carnegie Mellon University
Benjamin Miller : “Applications of the open graph dichotomy”
Description
The open graph dichotomy is a generalization of the perfect set theorem, ensuring that every open graph on an analytic set has either a countable coloring or a perfect clique. As the proof of this result is essentially the same as that of the perfect set theorem, it can be viewed as one of the very simplest descriptive settheoretic dichotomy theorems. Nevertheless, there is an infinitedimensional analog of the open graph dichotomy (whose proof is essentially the same) that has recently proven particularly useful in studying Borel functions, graphs, and sets of low complexity.
We will begin by stating and proving the infinitedimensional analog of the open graph dichotomy. We will then describe how it can be used to give particularly simple proofs of several wellknown facts, such as the Hurewicz dichotomies, the JayneRogers theorem, and Lecomte’s characterization of the existence of countable Borel colorings of low complexity. Finally, we will turn our attention to the new result that there is a twentyfour element basis, under closed continuous embeddability, for the class of Borel functions that are not Baire class one.
Marcos Mazari Armida: Categoricity of an AEC in three successive cardinals, Part 1
Date: Monday, October 31, 2016
Time: 5:00 – 6:30 PM
Location: Wean 8201
Model Theory Seminar, CMU
Marcos Mazari Armida
Title: Categoricity of an AEC in three successive cardinals, Part 1
Abstract: In this series of talks we will be working on Abstract Elementary Classes (AECs), a semantic generalization of first order Model Theory. One of the first things one looses when stepping out of the first order setting is the compactness theorem, which in particular assures us that if there is an infinite model then there is a model in each cardinality. What we will do in this series of talks is prove a theorem in this direction for AECs. More specically (under some cardinal arithmetic hypothesis) we will show that if an AEC K is categorical in $\lambda$, $\lambda^+$ and $\lambda^{++}$ then there is a model in K of size $\lambda^{+++}$. In order to do that we will have to develop many key concepts in the study of AECs like the concept of Galois Type, Reduced Type and Minimial Type. This talks will follow Saharon Shelah paper “Categoricity of an Abstract Elementary Class in two successive cardinals” [Sh576].
James Cummings: Cardinal invariants of the continuum
Mathematical logic seminar – October 18 2016
Time: 3:30pm – 4:30 pm
Room: Wean Hall 8220
Speaker: James Cummings
Department of Mathematical Sciences
CMU
Title: Cardinal invariants of the continuum
Abstract:
The cardinal invariants of the continuum are cardinals which measure properties of the continuum more subtle than its cardinality. We will define some of the important ones and discuss their properties.
Note: This seminar will provide some background for Mayanthe Malliaris’ forthcoming Appalachian Set Theory workshop on November 5, see workshop web page at http://www.math.cmu.edu/users/jcumming/Appalachian/malliaris_cmu_2016.html for details.