Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(55 intermediate revisions by 6 users not shown)
Line 1: Line 1:
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.
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
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' Van Vleck 901
* '''Where:''' Van Vleck B223
* '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ Jun Le Goh]
* '''Organizers:''' [https://uriandrews.netlify.app/ Uri Andrews] and [https://sites.google.com/view/hongyu-zhu/ Hongyu Zhu]


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.


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:  [mailto:join-grad-logic-sem@lists.wisc.edu join-grad-logic-sem@lists.wisc.edu]


== Spring 2022 ==
== Fall 2023 ==


The graduate logic seminar this semester will be run as MATH 975. Please enroll if you wish to participate.
The seminar will be run as a 1-credit seminar Math 975 in Fall 2023. If you are not enrolled but would like to audit it, please contact [mailto:andrews@math.wisc.edu Uri Andrews] and [mailto:hongyu@math.wisc.edu Hongyu Zhu].


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:
While you are welcome (and encouraged) to present on a topic of your own choice, there is also a "suggested reading" so that you can also read and present on a (small) section of it.
* 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].


=== January 25 - organizational meeting ===
Suggested reading: <!-- Chapters 4-7 of <i>[https://projecteuclid.org/ebooks/lecture-notes-in-logic/Aspects-of-Incompleteness/toc/lnl/1235416274 Aspects of Incompleteness]</i> by Per Lindström. -->
 
=== September 11 - Organizational Meeting ===


We will meet to assign speakers to dates.
We will meet to assign speakers to dates.


=== February 1 - Steffen Lempp ===
<!-- Template
 
=== '''September 18 - Karthik Ravishankar''' ===
'''Title:''' Lowness for Isomorphism ([https://wiki.math.wisc.edu/images/Karthik_talk.pdf Slides])
 
'''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.
 
-->


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. Giafman'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 ==
== 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 22:07, 29 May 2023

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.

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 2023

The seminar will be run as a 1-credit seminar Math 975 in Fall 2023. If you are not enrolled but would like to audit it, please contact Uri Andrews and Hongyu Zhu.

While you are welcome (and encouraged) to present on a topic of your own choice, there is also a "suggested reading" so that you can also read and present on a (small) section of it.

Suggested reading:

September 11 - Organizational Meeting

We will meet to assign speakers to dates.


Previous Years

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