Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
 
(10 intermediate revisions by the same user not shown)
Line 2: Line 2:


* '''When:''' Mondays 3:30-4:30 PM
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' Van Vleck B235
* '''Where:''' Van Vleck B211
* '''Organizer:''' Mariya Soskova
* '''Organizer:''' Joseph Miller


The talk schedule is arranged at the beginning of each semester. If you would like to participate, please contact the organizers.
The talk schedule is arranged at the beginning of each semester. If you would like to participate, please contact the organizers.
Line 9: Line 9:
<!--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]-->


== Spring 2025 ==
==Fall 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 [mailto:soskova@wisc.edu Mariya Soskova].
The seminar will be run as a 1-credit seminar Math 975. In Fall 2025 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:jmiller@math.wisc.edu Joe Miller].


Presentation Schedule: [https://docs.google.com/spreadsheets/d/1uRSaI1edJ5sepz57NV07ohIfBSKL9FgkvJvMAewk1ms/edit?usp=sharing Sign up here.]
Presentation Schedule: [https://docs.google.com/spreadsheets/d/1uRSaI1edJ5sepz57NV07ohIfBSKL9FgkvJvMAewk1ms/edit?usp=sharing Sign up here.]  
 
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.
 
<!--Zoom link for remote attendance: https://uwmadison.zoom.us/j/96168027763?pwd=bGdvL3lpOGl6QndQcG5RTFUzY3JXQT09 (Meeting ID: 961 6802 7763, Password: 975f23)-->
 
=== '''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:''' Seeing the forest does not account for the trees
 
'''Abstract:''' Say a first-order theory (or a type) has bounded axiomatization if it has an axiomatization by <math>\forall_n</math>-formulas for some finite n. In this talk, we will discuss basic properties of theories and types with (or without) bounded axiomatizations, and in particular whether boundedness of theories implies that of types. (The meaning of the title will be explained in due time.)
 
=== '''March 3 -  Uri Andrews''' ===
 
'''Title:''' On the spectra of computable models of disintegrated strongly minimal theories with bounded ranks
 
'''Abstract:'''  The spectrum of a strongly minimal theory characterizes which of its countable models have computable copies (indexed by their dimensions). We will focus on the disintegrated strongly minimal theories, i.e., where the algebraic closure of a set is the union of the algebraic closures of the elements of the set.
 
Somewhere in the late aughts, Alice Medvedev and I proved that if a theory is disintegrated strongly minimal and has a finite signature, then either all models are computable, no models are computable, or only the prime model is computable. Steffen Lempp and I tried to push this sort of analysis past finite signatures and we have results about theories which are disintegrated strongly minimal and every symbol in the (infinite) signature has rank less than or equal to 1 in the theory (i.e., you cannot have R(a,b,\bar{z}) if a and b are algebraically independent). Over this past winter break, I found a strategy to bring (some of) this analysis to strongly minimal theories in infinite languages as long as there is some finite N so that every symbol has rank less than or equal to N. I'll describe this strategy, and depending on time, I might even present something that loosely resembles a proof.
 
=== '''March 10 -  Logan Heath''' ===
 
'''Title:''' Degree Spectra of Theories
 
'''Abstract:''' I will discuss the notion of the degree spectrum of a theory, introduce a class of questions one might ask about such a thing, point to a few of the answers to such questions, and look a little more closely at one such spectrum to highlight the sorts of techniques that arise in the area.
 
 
=== '''March 17 -  Yiqing Wang''' ===
 
'''Title:''' The compactness theorem is overrated
 
'''Abstract:''' Elementary classes, or first-order logic in general, are limited in their ability to capture many natural mathematical classes, such as locally finite groups and Archimedean ordered fields. Conversely, obtaining meaningful results in the generality of non-elementary classes can be impossible. In 1978, Shelah introduced the notion of Abstract Elementary Classes (AECs), providing a framework for studying classes that are not first-order axiomatizable yet still possess rich model-theoretic properties and carry the same 'test question'.
 
In this talk, I will try to give an overview of AECs, prove Shelah’s Presentation Theorem, and highlight some open problems in this area.
 
=== '''March 31 -  Chiara Travesset''' ===
 
'''Title:''' tba
 
'''Abstract:''' tba
 
=== '''April 7th -  Taeyoung Em''' ===
 
'''Title:''' Randomness and betting strategies
 
'''Abstract:''' We will discuss in short definitions and some of the well-known theorems regarding randomness. Then we move on to the main topic of this talk which is relation between betting strategies and randomness. We show that computable martingales can be reduced down to simpler martingales, but this doesn't happen for c.e. martingales.
 
=== '''April 21 -  Ang Li???''' ===
 
'''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)-->
<!--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
==='''September 8 - Organizational Meeting'''===


=== '''November 19th -  Sections 4.1 and 4.2''' ===
We will meet to arrange the schedule


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


==='''September 22 -'''  ===


=== '''November 25th -  Sections 4.2 and 4.3''' ===
==='''September 29 -''' ===
==='''October 6 -''' ===


Back to the usual time and place. Ang Li will begin Section 4.2.
=== '''October 13 -''' ===


=== '''December 2nd - Section 4.3''' ===
==='''October 20 -''' ===


Ang Li will present Section 4.3.
=== '''October 27 -''' ===


=== '''December 9nd - Section 5.1''' ===
=== '''November 3 -''' ===


  Last seminar for this semester. Sapir Ben-Shahar will begin Section 5.1
==='''November 10 -''' ===


<!-- Template
==='''November 17 -'''  ===


=== '''September 18 - xxx''' ===
==='''November 24 -''' ===
'''Title:''' TBA ([https://wiki.math.wisc.edu/images/***.pdf Slides])


'''Abstract:''' TBA
==='''December 1 -''' ===


-->
==='''December 8 -'''  ===


== 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 16:33, 20 August 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 B211
  • Organizer: Joseph Miller

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


Fall 2025

The seminar will be run as a 1-credit seminar Math 975. In Fall 2025 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 Joe Miller.

Presentation Schedule: Sign up here.


September 8 - Organizational Meeting

We will meet to arrange the schedule

September 15 -

September 22 -

September 29 -

October 6 -

October 13 -

October 20 -

October 27 -

November 3 -

November 10 -

November 17 -

November 24 -

December 1 -

December 8 -

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