Difference between revisions of "Graduate Logic Seminar"

From UW-Math Wiki
Jump to navigation Jump to search
(146 intermediate revisions by 8 users not shown)
Line 1: Line 1:
The Graduate Logic Seminar is an informal space where graduate student and professors present topics related to logic which are not necessarly original or completed work. This is an space focus principally in  practicing presentation skills or learning materials that are not usually presented on a class.
+
The Graduate Logic Seminar is an informal space where graduate students and professors present topics related to logic which are not necessarily original or completed work. This is a space focused principally on practicing presentation skills or learning materials that are not usually presented in a class.
  
* '''When:''' Mondays, 4:00 PM – 5:00 PM (unless otherwise announced).
+
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' Van Vleck B235 (unless otherwise announced).
+
* '''Where:''' Van Vleck B139
* '''Organizers:''' [https://www.math.wisc.edu/~msoskova/ Mariya Soskava]
+
* '''Organizers:''' Karthik Ravishankar and [https://sites.google.com/wisc.edu/antonio Antonio Nakid Cordero]
  
Talks schedule are arrange and decide at the beginning of each semester. If you would like to participate, please contact one of the organizers.
+
The talk schedule is arranged at the beginning of each semester. If you would like to participate, please contact one of the organizers.
  
== Spring 2018 ==
+
Sign up for the graduate logic seminar mailing list:  join-grad-logic-sem@lists.wisc.edu
  
=== January 29, Organizational meeting ===
+
== Fall 2022 ==
  
This day we decided the schedule for the semester.
+
=== September 12 - Organizational Meeting ===
  
=== February 5, Uri Andrews ===
+
We will meet to assign speakers to dates.
  
Title: Building Models of Strongly Minimal Theories - Part 1
+
=== '''September 19 - Karthik Ravishankar''' ===
 +
'''Title:''' Lowness for Isomorphism
  
Abstract: Since I'm talking in the Tuesday seminar as well, I'll use
+
'''Abstract:''' A Turing degree is said to be low for isomorphism if it can only compute an isomorphism between computable structures only when a computable isomorphism already exists. In this talk, we show that the measure of the class of low for isomorphism sets in Cantor space is 0 and that no Martin Lof random is low for isomorphism.
the Monday seminar talk to do some background on the topic and some
 
lemmas that will go into the proofs in Tuesday's talk. There will be
 
(I hope) some theorems of interest to see on both days, and both on
 
the general topic of answering the following question: What do you
 
need to know about a strongly minimal theory in order to compute
 
copies of all of its countable models. I'll start with a definition
 
for strongly minimal theories and build up from there.
 
  
=== February 12, James Hanson ===
+
=== '''September 26 - Antonio Nakid Cordero''' ===
 +
'''Title:''' When Models became Polish: an introduction to the Topological Vaught Conjecture
  
Title: Finding Definable Sets in Continuous Logic
+
'''Abstract:''' Vaught's Conjecture, originally asked by Vaught in 1961, is one of the most (in)famous open problems in mathematical logic. The conjecture is that a complete theory on a countable language must either have countably-many or continuum-many non-isomorphic models. In this talk, we will discuss some of the main ideas that surround this conjecture, with special emphasis on a topological generalization in terms of the continuous actions of Polish groups.
  
Abstract: In order to be useful the notion of a 'definable set' in
+
=== '''October 3 - Yunting Zhang''' ===
continuous logic is stricter than a naive comparison to discrete logic
 
would suggest. As a consequence, even in relatively tame theories
 
there can be very few definable sets. For example, there is a
 
superstable theory with no non-trivial definable sets. As we'll see,
 
however, there are many definable sets in omega-stable,
 
omega-categorical, and other small theories.
 
  
=== February 19, Noah Schweber ===
+
=== '''October 10 - Yuxiao Fu''' ===
  
Title: Proper forcing
+
=== '''October 17 - Alice Vidrine''' ===
  
Abstract: Although a given forcing notion may have nice properties on
+
=== '''October 24 - Hongyu Zhu''' ===
its own, those properties might vanish when we apply it repeatedly.
 
Early preservation results (that is, theorems saying that the
 
iteration of forcings with a nice property retains that nice property)
 
were fairly limited, and things really got off the ground with
 
Shelah's invention of "proper forcing." Roughly speaking, a forcing is
 
proper if it can be approximated by elementary submodels of the
 
universe in a particularly nice way. I'll define proper forcing and
 
sketch some applications.
 
  
=== February 26, Patrick Nicodemus ===
+
=== '''October 31 - Break for Halloween''' ===
  
Title: A survey of computable and constructive mathematics in economic history
+
=== '''November 7 - John Spoerl''' ===
  
=== March 5, Tamvana Makulumi ===
+
=== '''November 14 - Josiah Jacobsen-Grocott''' ===
  
Title: Convexly Orderable Groups
+
=== '''November 21 - Karthik Ravishankar''' ===
  
=== March 12, Dan Turetsky (University of Notre Dame) ===
+
=== '''November 28 - Logan Heath''' ===
  
Title: Structural Jump
+
=== '''December 5 - Logan Heath''' ===
  
=== March 19, Ethan McCarthy ===
+
=== '''December 12 - TBA''' ===
  
Title: Networks and degrees of points in non-second countable spaces
+
== Previous Years ==
  
=== April 2, Wil Cocke ===
+
The schedule of talks from past semesters can be found [[Graduate Logic Seminar, previous semesters|here]].
 
 
Title: Characterizing Finite Nilpotent Groups via Word Maps
 
 
 
Abstract: In this talk, we will examine a novel characterization of finite
 
nilpotent groups using the probability distributions induced by word
 
maps. In particular we show that a finite group is nilpotent if and
 
only if every surjective word map has fibers of uniform size.
 
 
 
=== April 9, Tejas Bhojraj ===
 
 
 
Title: Quantum Randomness
 
 
 
Abstract: I will read the paper by Nies and Scholz where they define a notion of
 
algorithmic randomness for infinite sequences of quantum bits
 
(qubits). This talk will cover the basic notions of quantum randomness
 
on which my talk on Tuesday will be based.
 
 
 
=== April 16, [http://www.math.wisc.edu/~ongay/ Iván Ongay-Valverde] ===
 
 
 
Title: What can we say about sets made by the union of Turing equivalence classes?
 
 
 
Abstract: It is well known that given a real number x (in the real line) the set of all reals that have the same Turing degree (we will call this a Turing equivalence class) have order type 'the rationals' and that, unless x is computable, the set is not a subfield of the reals. Nevertheless, what can we say about the order type or the algebraic structure of a set made by the uncountable union of Turing equivalence classes?
 
 
 
This topic hasn't been deeply studied. In this talk I will focus principally on famous order types and answer whether they can be achieved or not. Furthermore, I will explain some possible connections with the automorphism problem of the Turing degrees.
 
 
 
This is a work in progress, so this talk will have multiple open questions and opportunities for feedback and public participation (hopefully).
 
 
 
=== April 23, [http://www.math.wisc.edu/~mccarthy/ Ethan McCarthy] (Thesis Defense) ===
 
 
 
Title: TBA
 
 
 
Abstract: TBA
 
 
 
=== April 30, [http://www.math.uconn.edu/~westrick/ Linda Brown Westrick] (from University Of Connecticut) ===
 
 
 
Title: TBA
 
 
 
Abstract: TBA
 
 
 
=== May 7, TBA ===
 
 
 
Title: TBA
 
 
 
Abstract: TBA
 
 
 
== Fall 2017 ==
 
 
 
=== September 11, Organizational meeting ===
 
 
 
This day we decided the schedule for the semester.
 
 
 
=== September 18, (person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== September 25, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== October 2, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== October 9, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== October 16, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== October 23, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== October 30, Iván Ongay-Valverde ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 6, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 13, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 20, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 27, (Person) ===
 
 
 
Title: TBA
 
 
 
Abstract: TBA
 
 
 
=== December 4, (Person) ===
 
 
 
Title: TBA
 
 
 
Abstract: TBA
 
 
 
=== December 11, (Person) ===
 
 
 
Title: TBA
 
 
 
Abstract: TBA
 
 
 
==Previous Years==
 
 
 
The schedule of talks from past semesters can be found [[Logic Graduate Seminar, previous semesters|here]].
 

Revision as of 01:20, 26 September 2022

The Graduate Logic Seminar is an informal space where graduate students and professors present topics related to logic which are not necessarily original or completed work. This is a space focused principally on practicing presentation skills or learning materials that are not usually presented in a class.

  • When: Mondays 3:30-4:30 PM
  • Where: Van Vleck B139
  • Organizers: Karthik Ravishankar and Antonio Nakid Cordero

The talk schedule is arranged at the beginning of each semester. If you would like to participate, please contact one of the organizers.

Sign up for the graduate logic seminar mailing list: join-grad-logic-sem@lists.wisc.edu

Fall 2022

September 12 - Organizational Meeting

We will meet to assign speakers to dates.

September 19 - Karthik Ravishankar

Title: Lowness for Isomorphism

Abstract: A Turing degree is said to be low for isomorphism if it can only compute an isomorphism between computable structures only when a computable isomorphism already exists. In this talk, we show that the measure of the class of low for isomorphism sets in Cantor space is 0 and that no Martin Lof random is low for isomorphism.

September 26 - Antonio Nakid Cordero

Title: When Models became Polish: an introduction to the Topological Vaught Conjecture

Abstract: Vaught's Conjecture, originally asked by Vaught in 1961, is one of the most (in)famous open problems in mathematical logic. The conjecture is that a complete theory on a countable language must either have countably-many or continuum-many non-isomorphic models. In this talk, we will discuss some of the main ideas that surround this conjecture, with special emphasis on a topological generalization in terms of the continuous actions of Polish groups.

October 3 - Yunting Zhang

October 10 - Yuxiao Fu

October 17 - Alice Vidrine

October 24 - Hongyu Zhu

October 31 - Break for Halloween

November 7 - John Spoerl

November 14 - Josiah Jacobsen-Grocott

November 21 - Karthik Ravishankar

November 28 - Logan Heath

December 5 - Logan Heath

December 12 - TBA

Previous Years

The schedule of talks from past semesters can be found here.