Difference between revisions of "Graduate Logic Seminar"

From UW-Math Wiki
Jump to navigation Jump to search
 
(103 intermediate revisions by 4 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 a space focused principally on practicing presentation skills or learning materials that are not usually presented in 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 4p-5p
+
* '''When:''' Tuesdays 4-5 PM
* '''Where:''' Van Vleck B223.
+
* '''Where:''' Van Vleck 901
* '''Organizers:''' [https://www.math.wisc.edu/~omer/ Omer Mermelstein]
+
* '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ 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.
 
The talk schedule is arranged at the beginning of each semester. If you would like to participate, please contact one of the organizers.
Line 9: Line 9:
 
Sign up for the graduate logic seminar mailing list:  join-grad-logic-sem@lists.wisc.edu
 
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.
  
== Fall 2019 - Tentative schedule ==
+
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].
  
=== September 5 - Organizational meeting ===
+
=== January 25 - organizational meeting ===
  
=== September 9 - No seminar ===
+
We will meet to assign speakers to dates.
  
=== September 16 - Daniel Belin ===
+
=== February 1 - Steffen Lempp ===
Title: Lattice Embeddings of the m-Degrees and Second Order Arithmetic
 
  
Abstract: Lachlan, in a result later refined and clarified by Odifreddi, proved in 1970 that initial segments of the m-degrees can be embedded as an upper semilattice formed as the limit of finite distributive lattices. This allows us to show that the many-one degrees codes satisfiability in second-order arithmetic, due to a later result of Nerode and Shore. We will take a journey through Lachlan's rather complicated construction which sheds a great deal of light on the order-theoretic properties of many-one reducibility.
+
I will give an overview of the topics we will cover:
  
=== September 23 - Daniel Belin ===
+
1. the base theory PA^- and the induction and bounding axioms for Sigma_n-formulas, and how they relate to each other,
  
Title: Lattice Embeddings of the m-Degrees and Second Order Arithmetic - Continued
+
2. the equivalence of Sigma_n-induction with a version of Sigma_n-separation (proved by H. Friedman),
  
=== September 30 - Josiah Jacobsen-Grocott ===
+
3. the Grzegorczyk hierarchy of fast-growing functions,
  
Title: Scott Rank of Computable Models
+
4. end extensions and cofinal extensions,
  
Abstract: Infinatary logic extends the notions of first order logic by allowing infinite formulas. Scott's Isomorphism Theorem states that any countable structure can be characterized up to isomorphism by a single countable sentence. Closely related to the complexity of this sentence is what is known as the Scott Rank of the structure. In this talk we restrict our attention to computable models and look at an upper bound on the Scott Rank of such structures.
+
5. recursive saturation and resplendency,
  
=== October 7 - Josiah Jacobsen-Grocott ===
+
6. standard systems and coded types,
  
Title: Scott Rank of Computable Codels - Continued
+
7. the McDowell-Specker Theorem that every model of PA has a proper elementary end extension, and
  
=== October 14 - Tejas Bhojraj ===
+
8. Gaifman's theorem that every model of PA has a minimal elementary end extension.
  
Title: Solovay and Schnorr randomness for infinite sequences of qubits.
+
I will sketch the basic definitions and state the main theorems, in a form that one can appreciate without too much
 +
background.
  
Abstract : We define Solovay and Schnorr randomness in the quantum setting. We then prove quantum versions of the law of large numbers and of the Shannon McMillan Breiman theorem (only for the iid case) for quantum Schnorr randoms.
+
=== February 8 - Karthik Ravishankar ===
  
=== October 21 - Tejas Bhojraj ===
+
Title: Collection axioms
  
Title: Solovay and Schnorr randomness for infinite sequences of qubits.
+
We will discuss parts 1 and 2 of Wong's notes.
  
=== October 28 - Two short talks ===
+
=== February 15 - Karthik Ravishankar, Yunting Zhang ===
  
Iván Ongay Valverde and James Earnest Hanson
+
Title: Collection axioms/The Weak König Lemma
  
=== November 4 - Two short talks ===
+
Karthik will finish part 2 of Wong's notes. Then Yunting will start on part 3 of Wong's notes.
  
Manlio Valenti and Patrick Nicodemus
+
=== February 22 - Yunting Zhang ===
  
=== November 11 - Manlio Valenti I ===
+
Title: The Weak König Lemma
  
=== November 18 - Manlio Valenti II ===
+
We will finish part 3 of Wong's notes.
  
=== November 25 - Two short talks ===
+
=== March 22 - Ang Li ===
Speakers TBD
 
  
=== December 2 - Iván Ongay Valverde I ===
+
Title: The Arithmetized Completeness Theorem
  
=== December 9 - Iván Ongay Valverde II ===
+
We will discuss part 4 of Wong's notes.
  
==Previous Years==
+
=== March 29 - Ang Li ===
 +
 
 +
Title: The Arithmetized Completeness Theorem
 +
 
 +
We will finish part 4 of Wong's notes.
 +
 
 +
=== April 5 - Antonio Nákid Cordero ===
 +
 
 +
Title: Semiregular cuts
 +
 
 +
We will start on part 5 of Wong's notes.
 +
 
 +
=== April 12 - Antonio Nákid Cordero/Alice Vidrine ===
 +
 
 +
Title: Semiregular cuts/End and cofinal extensions
 +
 
 +
We will finish part 5 of Wong's notes and then start on part 6.
 +
 
 +
=== April 19 - Alice Vidrine ===
 +
 
 +
Title: End and cofinal extensions
 +
 
 +
We will finish part 6 of Wong's notes.
 +
 
 +
=== May 3 - No seminar today ===
 +
 
 +
== 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]].

Latest revision as of 12:44, 2 May 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.

February 8 - Karthik Ravishankar

Title: Collection axioms

We will discuss parts 1 and 2 of Wong's notes.

February 15 - Karthik Ravishankar, Yunting Zhang

Title: Collection axioms/The Weak König Lemma

Karthik will finish part 2 of Wong's notes. Then Yunting will start on part 3 of Wong's notes.

February 22 - Yunting Zhang

Title: The Weak König Lemma

We will finish part 3 of Wong's notes.

March 22 - Ang Li

Title: The Arithmetized Completeness Theorem

We will discuss part 4 of Wong's notes.

March 29 - Ang Li

Title: The Arithmetized Completeness Theorem

We will finish part 4 of Wong's notes.

April 5 - Antonio Nákid Cordero

Title: Semiregular cuts

We will start on part 5 of Wong's notes.

April 12 - Antonio Nákid Cordero/Alice Vidrine

Title: Semiregular cuts/End and cofinal extensions

We will finish part 5 of Wong's notes and then start on part 6.

April 19 - Alice Vidrine

Title: End and cofinal extensions

We will finish part 6 of Wong's notes.

May 3 - No seminar today

Previous Years

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