Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
 
(176 intermediate revisions by 9 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:''' Mondays 4p-5p (unless stated otherwise)
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' on line (ask for code).
* '''Where:''' Van Vleck B235
* '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ Jun Le Goh]
* '''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:  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 2020 - Tentative schedule ==
== Spring 2025 ==


=== September 14 - Josiah Jacobsen-Grocott ===
The seminar will be run as a 1-credit seminar Math 975. In Spring 2025, we will finish last semester's topic on Higher Computability Theory.Once we are done students will present a logic topic of their choice (it could be original work, but does not have to be).  If you are not enrolled but would like to audit it, please contact [mailto:soskova@wisc.edu Mariya Soskova].


Title: Degrees of points in topological spaces
Presentation Schedule: [https://docs.google.com/spreadsheets/d/1uRSaI1edJ5sepz57NV07ohIfBSKL9FgkvJvMAewk1ms/edit?usp=sharing Sign up here.]


Abstract: An overview of some results from Takayuki Kihara, Keng Meng Ng, and Arno Pauly in their paper Enumeration Degrees and Non-Metrizable Topology. We will look at a range of topological spaces and the corresponding classes in the enumeration degrees as well as ways in which we can distinguish the type of classes using the separation axioms.
Notes on Higher Computability Theory: [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.  


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


Title: The Semilattice of Definable Sets in Continuous Logic
=== '''January 27 - Organizational Meeting and Sapir Ben-Shahar''' ===


Abstract: After an analysis-free exposition of definable sets in continuous logic, we will present a fun, illustrated proof that any finite bounded lattice can be the poset of definable subsets of $S_1(T)$ for a continuous theory $T$.
Mariya Soskova will call for volunteers to sign up for presentations.  


=== October 5 - Tejas Bhojraj from 3:30PM-4:00PM ===
Sapir Ben-Shahar will wrap up Section 5.1


Title: A Levin-Schnorr type result for Weak Solovay random states.
=== '''February 3 - Taeyoung Em''' ===


Abstract: We look at the initial-segment complexity of Weak Solovay quantum random states using MK, a prefix-free version of quantum Kolmogorov complexity. The statement of our result is similar to the Levin-Schnorr theorem in classical algorithmic randomness.
Taeyoung Em will present Section 5.3.  


=== November 9 - Karthik Ravishankar ===
=== '''February 10 - Hongyu Zhu''' ===


Title: Elementary submodels in infinite combinatorics
Hongyu Zhu will present Section 5.3


Abstract: The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. In the first part of the talk, we quickly cover the basic concepts involved for proving results using elementary submodels, and move on to provide two examples of application of the technique to prove two popular results from set theory: The Delta System lemma and the Fodors Pressing down lemma . We provide both the classical proof as well as a proof using elementary submodels to contrast the two approaches.
=== '''February 17 -  Karthik Ravishankar''' ===


=== November 16 - Karthik Ravishankar ===
'''Title:''' Strong minimal covers and the cupping property


Title: Elementary submodels in infinite combinatorics, part II
'''Abstract:''' A longstanding question in degree theory has been whether every minimal Turing degree has a strong minimal cover. Meanwhile a strong example of degrees without SMC's are those which have the cupping property. It is known that PA degrees have the cupping property, as do degrees with a certain amount of escaping power. On the other hand, it is known that being weak in the sense of being non DNC and Hyperimmune-free lets you have a SMC. Degrees with the cupping property are closed upwards while it is not known if degrees with SMC are closed downwards.  It is also not known if every degree either has the cupping property or a SMC. In this talk we will review several of these results and present techniques used to build SMCs.


Abstract: In the second part of the talk, we give a proof Fodors Pressing down lemma, along with an overview of the slightly larger proof of the Nash Williams theorem which states that a graph is decomposable as a disjoint union of cycles if and only if it has no odd cut.
=== '''February 24 -  Hongyu Zhu''' ===


=== Tuesday, November 24 - Tonicha Crook (Swansea University) from 9:00AM-10:00AM ===
'''Title:''' tba


Title: The Weihrauch Degree of Finding Nash Equilibria in Multiplayer Games
'''Abstract:''' tba


Abstract: Is there an algorithm that takes a game in normal form as input, and outputs a Nash equilibrium? If the payoffs are integers, the answer is yes, and a lot of work has been done in its computational complexity. If the payoffs are permitted to be real numbers, the answer is no, for continuity reasons. It is worthwhile to investigate the precise degree of non-computability (the Weihrauch degree), since knowing the degree entails what other approaches are available (eg, is there a randomized algorithm with positive success change?). The two player case has already been fully classified, but the multiplayer case remains open and is addressed here. As well as some insight into finding the roots of polynomials, which is essential in our research. An in-depth introduction to Weihrauch Reducibility will be included in the presentation, along with a small introduction to Game Theory.
=== '''March 3 - Uri Andrews''' ===


=== November 30 - Yvette Ren ===
'''Title:''' tba


Title, abstract TBA
'''Abstract:''' tba


==Previous Years==
=== '''Macrh 10 -  Logan Heath''' ===
 
'''Title:''' tba
 
'''Abstract:''' tba
 
 
=== '''Macrh 17 -  Yiqing Wang''' ===
 
'''Title:''' tba
 
'''Abstract:''' tba
 
=== '''Macrh 31 -  Chiara Travesset''' ===
 
'''Title:''' tba
 
'''Abstract:''' tba
 
 
 
== 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 [mailto:soskova@wisc.edu Mariya Soskova].
 
Presentation Schedule: [https://docs.google.com/spreadsheets/d/1ect-dgHdoHOgq4-5BGFiDh6pPThLfDg69Yg__-b_5RY/edit?usp=sharing Sign up here.]
 
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)-->
 
=== '''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.
 
=== '''December 2nd -  Section 4.3''' ===
 
Ang Li will present Section 4.3.
 
=== '''December 9nd -  Section 5.1''' ===
 
Last seminar for this semester. Sapir Ben-Shahar will begin Section 5.1
 
<!-- Template
 
=== '''September 18 - xxx''' ===
'''Title:''' TBA ([https://wiki.math.wisc.edu/images/***.pdf Slides])
 
'''Abstract:''' TBA
 
-->
 
== 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 13:19, 11 February 2025

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

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


Spring 2025

The seminar will be run as a 1-credit seminar Math 975. In Spring 2025, we will finish last semester's topic on Higher Computability Theory.Once we are done students will present a logic topic of their choice (it could be original work, but does not have to be). If you are not enrolled but would like to audit it, please contact Mariya Soskova.

Presentation Schedule: Sign up here.

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


January 27 - Organizational Meeting and Sapir Ben-Shahar

Mariya Soskova will call for volunteers to sign up for presentations.

Sapir Ben-Shahar will wrap up Section 5.1

February 3 - Taeyoung Em

Taeyoung Em will present Section 5.3.

February 10 - Hongyu Zhu

Hongyu Zhu will present Section 5.3

February 17 - Karthik Ravishankar

Title: Strong minimal covers and the cupping property

Abstract: A longstanding question in degree theory has been whether every minimal Turing degree has a strong minimal cover. Meanwhile a strong example of degrees without SMC's are those which have the cupping property. It is known that PA degrees have the cupping property, as do degrees with a certain amount of escaping power. On the other hand, it is known that being weak in the sense of being non DNC and Hyperimmune-free lets you have a SMC. Degrees with the cupping property are closed upwards while it is not known if degrees with SMC are closed downwards. It is also not known if every degree either has the cupping property or a SMC. In this talk we will review several of these results and present techniques used to build SMCs.

February 24 - Hongyu Zhu

Title: tba

Abstract: tba

March 3 - Uri Andrews

Title: tba

Abstract: tba

Macrh 10 - Logan Heath

Title: tba

Abstract: tba


Macrh 17 - Yiqing Wang

Title: tba

Abstract: tba

Macrh 31 - Chiara Travesset

Title: tba

Abstract: tba


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.

December 2nd - Section 4.3

Ang Li will present Section 4.3.

December 9nd - Section 5.1

Last seminar for this semester. Sapir Ben-Shahar will begin Section 5.1


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=28089"