Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
 
(55 intermediate revisions by 3 users not shown)
Line 2: Line 2:


* '''When:''' Mondays 3:30-4:30 PM
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' Van Vleck B223
* '''Where:''' Van Vleck B123
* '''Organizers:''' [https://uriandrews.netlify.app/ Uri Andrews] and [https://sites.google.com/view/hongyu-zhu/ Hongyu Zhu]
* '''Organizer:''' Mariya Soskova


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 the organizers.


Sign up for the graduate logic seminar mailing list:  [mailto:join-grad-logic-sem@lists.wisc.edu 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]


== Fall 2023 ==
== Fall 2024 ==


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].
The seminar will be run as a 1-credit seminar Math 975 . In Fall 2024, the topic will be Higher Computability Theory. We will follow notes by Noam Greenberg. If you are not enrolled but would like to audit it, please contact [mailto:soskova@wisc.edu Mariya Soskova].


While you are welcome (and encouraged) to present on a topic of your own choice, feel free to ask for help from faculties and/or other graduate students.
Presentation Schedule: [https://docs.google.com/spreadsheets/d/1ect-dgHdoHOgq4-5BGFiDh6pPThLfDg69Yg__-b_5RY/edit?usp=sharing Sign up here.]


Presentation Schedule: https://docs.google.com/spreadsheets/d/15Qd4EzrrKpn1Ct5tur1P_FDc2czsdAVnUf_pfp65Lb4/edit?usp=sharing
Notes: [https://uwmadison.box.com/s/j3xftdj1i70d4lblxhzswhg9e25ajcpq Download the notes here.] You will need your UW-login. Please, do not distribute these notes without permission from the author.


Zoom link for remote attendance: https://uwmadison.zoom.us/j/96168027763?pwd=bGdvL3lpOGl6QndQcG5RTFUzY3JXQT09 (Meeting ID: 961 6802 7763, Password: 975f23)
<!--Zoom link for remote attendance: https://uwmadison.zoom.us/j/96168027763?pwd=bGdvL3lpOGl6QndQcG5RTFUzY3JXQT09 (Meeting ID: 961 6802 7763, Password: 975f23)-->


Possible readings:
=== '''September 9 - Organizational Meeting''' ===
* (Elementary) Proof Theory: 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.
* An invitation to model-theoretic Galois theory.  <i>[https://arxiv.org/abs/0909.4340 On arxiv here.]</i>
* Variations on the Feferman-Vaught Theorem <i>[https://arxiv.org/abs/1812.02905 On arxiv here.]</i>
* Any of several papers on "Turing Computable Embeddings"
* Computability/Model/Set Theory: Consult faculties/students for recommended texts on specific areas.


=== September 11 - Organizational Meeting ===
Mariya Soskova will start with the first sections from the notes.


We will meet to assign speakers to dates.
We will then assign speakers to dates and topics.


=== '''September 18 - Taeyoung Em''' ===
=== '''September 16 - Sections 1.2-1.4''' ===
'''Title:''' Explicit construction of non-quasidetermined game on <math>\mathcal P(2^{\mathbb N})</math> without using A.C. ([https://wiki.math.wisc.edu/images/Gale-Stewart_implies_A.C..pdf Supplement])


'''Abstract:''' We will go over briefly some basic information about trees and infinite games. Then we prove the Gale-Stewart Theorem. The proof of the theorem motivates definition of quasistrategy. Then we will briefly introduce Borel determinacy. We will go over how the usage of A.C. makes convenient for us to make a non-quasidetermined or undertermined game. We will give an explicit construction of a non-quasidetermined game on <math>\mathcal P(2^{\mathbb N})</math> without using A.C.
Kanav Madhura will continue with Sections 1.2-1.4.  


=== '''September 25 - Karthik Ravishankar''' ===
=== '''September 23 - Sections 1.3-1.4 and 2.1-2.2''' ===
'''Title:''' Spectra of structures


'''Abstract:''' One way to measure the complexity of a structure is via its spectrum - the set of Turing degrees of its copies. In this talk, we'll look at the definition and first properties of the spectrum followed by some examples. In particular, we'll show that the non-computable degrees and the hyperimmune degrees form a spectrum while the DNC degrees do not.
Kanav Madhura will continue with Sections 1.3-1.4. Lucas Duckworth will be ready with Sections 2.1 and 2.2 should there be time.  


=== '''October 2 - Hongyu Zhu''' ===
=== '''September 30 -  Sections 2.2 and 2.3-2.5''' ===
'''Title:''' Continuum Hypothesis: On Platonism and Pluralism ([https://wiki.math.wisc.edu/images/CH.pdf Slides])


'''Abstract:''' Despite its independence from ZFC, the continuum hypothesis continues to be of interest to logicians. In this talk, we will see arguments for settling the truth of CH in one way or another (or yet another). We will see how mathematical arguments (the inner model program) are intertwined with philosophical beliefs (mathematical Platonism and pluralism) about the set-theoretic universe(s).
Lucas Duckworth will finish Section 2.2. Karthik Ravishankar will begin 2.3, 2.4, and 2.5.
=== '''October 7th -  Sections 2.4 and 2.5''' ===


=== '''October 9 - Hannah Ashbach ''' ===
Karthik Ravishankar will  finish, 2.4, and 2.5. Liang Yu will give a talk at 4:00pm.
'''Title:''' An Introduction to Constructive Mathematics ([https://wiki.math.wisc.edu/images/An_Introduction_to_Constructive_Mathematics.pdf Slides] and [https://uwmadison.zoom.us/rec/share/UIxI2m2WWMnitZTd1oQxYxl6vpashJdvf_2UtN6erlFXN9yNgm7q0mhXw1min0-L.cz3b7tsbBPlsgxD6 Recording])


'''Abstract:''' Have you ever written a mathematical proof and felt dissatisfied after writing QED? Perhaps you had proven the existence of a particularly complicated mathematical object, but you have no clue how that object may actually look or be constructed. Or perhaps you are ready to denounce the Axiom of Choice after reading about its far-reaching consequences. Constructive logic is a formal logic system that seeks to clear up these concerns for mathematicians, though not all mathematicians agree with the power it holds-- or takes away.
=== '''October 14th -  Sections 2.6 and 2.7''' ===


=== '''October 16 - Rune Chen ''' ===
Bjarki Gunnarsson  will present Sections 2.6 and 2.7
'''Title:''' TBA


'''Abstract:''' TBA
=== '''October 21th - Section 3.1''' ===
 
=== '''October 23 - John Spoerl ''' ===
'''Title:''' TBA
 
'''Abstract:''' TBA
 
=== '''October 30 - Chiara Travesset ''' ===
'''Title:''' TBA
 
'''Abstract:''' TBA


=== '''November 6 - Antonio Nakid Cordero ''' ===
Karthik Ravishankar will present Section 3.1 
'''Title:''' TBA


'''Abstract:''' TBA
=== '''October 28th -  Sections 3.2 and 3.3''' ===


=== '''November 13 - Alice Vidrine ''' ===
Karthik Ravishankar will finish Sections 3.2  and John Spoerl will begin Section 3.3
'''Title:''' TBA


'''Abstract:''' TBA
=== '''November 4th -  Sections 3.3 and 3.4''' ===


=== '''November 20 - Logan Heath ''' ===
John Spoerl will finish Sections 3.3 and 3.4
'''Title:''' TBA


'''Abstract:''' TBA
=== '''November 11th -  Section 4.1''' ===


=== November 27 - Thanksgiving Break ===
Antonion Nakid-Cordero will present Section 4.1
'''Title:''' TBA


'''Abstract:''' TBA
=== '''November 19th -  Sections 4.1 and 4.2''' ===


=== '''December 4 - Ang Li ''' ===
Start 4:00PM in VV901! Antonion Nakid-Cordero will continue with Section 4.1, Ang Li will begin Section 4.2.
'''Title:''' TBA


'''Abstract:''' TBA


=== '''December 11 - Mei Rose Connor ''' ===
=== '''November 25th - Sections 4.2 and 4.3''' ===
'''Title:''' TBA


'''Abstract:''' TBA
Back to the usual time and place. Ang Li will begin Section 4.2.


<!-- Template
<!-- Template


=== '''September 18 - Karthik Ravishankar''' ===
=== '''September 18 - xxx''' ===
'''Title:''' Lowness for Isomorphism ([https://wiki.math.wisc.edu/images/Karthik_talk.pdf Slides])
'''Title:''' TBA ([https://wiki.math.wisc.edu/images/***.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.
'''Abstract:''' TBA


-->
-->

Latest revision as of 15:37, 25 November 2024

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 B123
  • Organizer: Mariya Soskova

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

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

Fall 2024

The seminar will be run as a 1-credit seminar Math 975 . In Fall 2024, the topic will be Higher Computability Theory. We will follow notes by Noam Greenberg. If you are not enrolled but would like to audit it, please contact Mariya Soskova.

Presentation Schedule: Sign up here.

Notes: Download the notes here. You will need your UW-login. Please, do not distribute these notes without permission from the author.


September 9 - Organizational Meeting

Mariya Soskova will start with the first sections from the notes.

We will then assign speakers to dates and topics.

September 16 - Sections 1.2-1.4

Kanav Madhura will continue with Sections 1.2-1.4.

September 23 - Sections 1.3-1.4 and 2.1-2.2

Kanav Madhura will continue with Sections 1.3-1.4. Lucas Duckworth will be ready with Sections 2.1 and 2.2 should there be time.

September 30 - Sections 2.2 and 2.3-2.5

Lucas Duckworth will finish Section 2.2. Karthik Ravishankar will begin 2.3, 2.4, and 2.5.

October 7th - Sections 2.4 and 2.5

Karthik Ravishankar will finish, 2.4, and 2.5. Liang Yu will give a talk at 4:00pm.

October 14th - Sections 2.6 and 2.7

Bjarki Gunnarsson will present Sections 2.6 and 2.7

October 21th - Section 3.1

Karthik Ravishankar will present Section 3.1

October 28th - Sections 3.2 and 3.3

Karthik Ravishankar will finish Sections 3.2 and John Spoerl will begin Section 3.3

November 4th - Sections 3.3 and 3.4

John Spoerl will finish Sections 3.3 and 3.4

November 11th - Section 4.1

Antonion Nakid-Cordero will present Section 4.1

November 19th - Sections 4.1 and 4.2

Start 4:00PM in VV901! Antonion Nakid-Cordero will continue with Section 4.1, Ang Li will begin Section 4.2.


November 25th - Sections 4.2 and 4.3

Back to the usual time and place. Ang Li will begin Section 4.2.


Previous Years

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

Retrieved from "https://wiki.math.wisc.edu/index.php?title=Graduate_Logic_Seminar&oldid=27653"