Difference between revisions of "Graduate Logic Seminar"

From UW-Math Wiki
Jump to: navigation, search
(February 1 - Steffen Lempp)
(125 intermediate revisions by 6 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:''' Tuesdays 4-5 PM
* '''Where:''' Van Vleck B235 (unless otherwise announced).
+
* '''Where:''' Van Vleck 901
* '''Organizers:''' [https://www.math.wisc.edu/~msoskova/ Mariya Soskava]
+
* '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ Jun Le Goh]
  
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 ===
+
== Spring 2022 ==
  
This day we decided the schedule for the semester.
+
The graduate logic seminar this semester will be run as MATH 975. Please enroll if you wish to participate.
  
=== February 5, (person) ===
+
We plan to cover the first 9 parts of [https://blog.nus.edu.sg/matwong/teach/modelarith/ Tin Lok Wong's notes], as well as a few other relevant topics which are not covered in the notes:
 +
* Properness of the induction/bounding hierarchy (chapter 10 of Models of Peano Arithmetic by Kaye is a good source)
 +
* Tennenbaum's theorem (this is a quick consequence of the main theorem of part 4, so it should be combined with part 4 or part 5)
 +
* Other facts found in chapter 1 of [http://homepages.math.uic.edu/~marker/marker-thesis.pdf David Marker's thesis].
  
Title:
+
=== January 25 - organizational meeting ===
  
Abstract:
+
We will meet to assign speakers to dates.
  
=== February 12, (Person) ===
+
=== February 1 - Steffen Lempp ===
  
Title:  
+
I will give an overview of the topics we will cover:  
  
Abstract:
+
1. the base theory PA^- and the induction and bounding axioms for Sigma_n-formulas, and how they relate to each other,
  
=== February 19, (Person) ===
+
2. the equivalence of Sigma_n-induction with a version of Sigma_n-separation (proved by H. Friedman),
  
Title:
+
3. the Grzegorczyk hierarchy of fast-growing functions,
  
Abstract:
+
4. end extensions and cofinal extensions,
  
=== February 26, (Person) ===
+
5. recursive saturation and resplendency,
  
Title:
+
6. standard systems and coded types,
  
Abstract:
+
7. the McDowell-Specker Theorem that every model of PA has a proper elementary end extension, and
  
=== March 5, (Person) ===
+
8. Gaifman's theorem that every model of PA has a minimal elementary end extension.
  
Title:
+
I will sketch the basic definitions and state the main theorems, in a form that one can appreciate without too much
 +
background.
  
Abstract:
+
== Previous Years ==
  
=== March 12, (Person) ===
+
The schedule of talks from past semesters can be found [[Graduate Logic Seminar, previous semesters|here]].
 
 
Title:
 
 
 
Abstract:
 
 
 
=== March 19, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== April 2, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== April 9, (Person) ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== 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 16:28, 18 January 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: Tuesdays 4-5 PM
  • Where: Van Vleck 901
  • Organizers: Jun Le Goh

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

Spring 2022

The graduate logic seminar this semester will be run as MATH 975. Please enroll if you wish to participate.

We plan to cover the first 9 parts of Tin Lok Wong's notes, as well as a few other relevant topics which are not covered in the notes:

  • Properness of the induction/bounding hierarchy (chapter 10 of Models of Peano Arithmetic by Kaye is a good source)
  • Tennenbaum's theorem (this is a quick consequence of the main theorem of part 4, so it should be combined with part 4 or part 5)
  • Other facts found in chapter 1 of David Marker's thesis.

January 25 - organizational meeting

We will meet to assign speakers to dates.

February 1 - Steffen Lempp

I will give an overview of the topics we will cover:

1. the base theory PA^- and the induction and bounding axioms for Sigma_n-formulas, and how they relate to each other,

2. the equivalence of Sigma_n-induction with a version of Sigma_n-separation (proved by H. Friedman),

3. the Grzegorczyk hierarchy of fast-growing functions,

4. end extensions and cofinal extensions,

5. recursive saturation and resplendency,

6. standard systems and coded types,

7. the McDowell-Specker Theorem that every model of PA has a proper elementary end extension, and

8. Gaifman's theorem that every model of PA has a minimal elementary end extension.

I will sketch the basic definitions and state the main theorems, in a form that one can appreciate without too much background.

Previous Years

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