Difference between revisions of "Graduate Logic Seminar"

From UW-Math Wiki
Jump to navigation Jump to search
(111 intermediate revisions by 5 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:''' Fridays, 3:30 PM - 4:30 PM (unless otherwise announced).
+
* '''When:''' Tuesdays 4-5 PM
* '''Where:''' Van Vleck B115 (unless otherwise announced).
+
* '''Where:''' Van Vleck 901
* '''Organizers:''' [https://www.math.wisc.edu/~schweber/ Noah Schweber]
+
* '''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.
  
== Fall 2018 ==
+
Sign up for the graduate logic seminar mailing list:  join-grad-logic-sem@lists.wisc.edu
  
=== September 7, 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.
  
=== September 14, [https://sites.google.com/a/wisc.edu/schweber/ Noah Schweber] ===
+
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.
  
=== September 21,  ===
+
=== 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,
  
=== October 28, ===
+
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,
  
=== October 5, ===
+
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
  
=== October 12,  ===
+
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 ==
 
 
=== October 19,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== October 26,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 2,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 9,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 16,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 23,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== November 30,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== December 7,  ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== December 14, ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
=== December 21, ===
 
 
 
Title:
 
 
 
Abstract:
 
 
 
==Previous Years==
 
  
 
The schedule of talks from past semesters can be found [[Graduate Logic Seminar, previous semesters|here]].
 
The schedule of talks from past semesters can be found [[Graduate Logic 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.