Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
 
(35 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] and [https://uwmadison.zoom.us/rec/share/lSe2BL28988PGmmthWKA6FM7bWOJ0eR6vxP4laS7O6ImNN2gQ5skPJ6-C8KlbGcm.G48mQQ0qlW-lo3gr Recording]; Passcode: .iXJs?1t)


'''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]; Passcode: 5.$c5L+2)


'''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 ''' ===
'''Title:''' An Introduction to Model-Theoretic Galois Theory
 
'''Abstract:''' Given an arbitrary first-order theory with elimination of imaginaries, the standard Galois theory can be translated into a model-theoretic version, which can be further generalized and thus be useful in other algebraic settings. In this talk, we will give a brief introduction to model-theoretic Galois theory and then look at a simple case of model-theoretic Galois correspondence. We will skip the detailed discussion of elimination of imaginaries by choosing our theory T to be a first-order theory coding finite sets and working in a large enough saturated model M of T.
 
=== '''October 23 - John Spoerl ''' ===
'''Title:''' The Computational Content of Forcing
 
'''Abstract:''' Given information about a ground model, how much can you know about it’s forcing extensions? Given a forcing extension, how much can you know about its ground model? This talk will be a primer on forcing and a review of the main results of Hamkins, Miller and Williams’ 2020 paper: “Forcing as a Computational Process”.
 
=== '''October 30 - Chiara Travesset ''' ===
'''Title:''' Mission-time LTL (MLTL) Formula Validation Via Regular Expressions
 
'''Abstract:''' Mission-time Linear Temporal Logic (mLTL) is an extension of propositional logic that includes temporal operators over finite intervals of time. A computation is a (finite) sequence consisting of a truth assignment for each propositional variable at each time step. This presentation will describe how we can use regular expressions to describe the structure of the computations that make a given mLTL formula true. We prove soundness and completeness, and also give an implemented algorithm (the WEST program) and analyze its complexity both theoretically and experimentally. We generate a test suite using control flow diagrams to robustly test the code. Finally, we present the REST theorem, which significantly simplifies certain sets of computations. This talk only requires basic familiarity with propositional logic and computer science.
 
=== '''November 6 - Antonio Nakid Cordero ''' ===
'''Title:''' Martin's Conjecture in the Turing degrees and the Enumeration Degrees
 
'''Abstract:''' Martin's Conjecture is an attempt to formalize the empirical phenomenon that "naturally occurring" Turing degrees are well-ordered. In this talk, I'll go over how one can make that into a precise mathematical statement, a uniform version of the conjecture that has been fully resolved, and some of the complications of trying to propose a similar conjecture in the enumeration degrees. If time allows, I'll report on my ongoing project in this direction.
 
=== '''November 13 - Alice Vidrine ''' ===
'''Title:''' Enumeration Weihrauch degrees and closed choice problems ([https://wiki.math.wisc.edu/images/EWdeg_Grad_seminar_Fall_23.pdf Slides] and [https://uwmadison.zoom.us/rec/share/F_pDYkWhHGiMTy7Rkqrb_PpeJnjxBCo0ZIMOEHV4CP-XfJodbV-P8igStgVwiXq4.A7ONs9u5Em6-3Gvp Recording] Passcode: C89k#5&0)
 
'''Abstract:''' In the Weihrauch degrees, we think of elements of Baire space as names for elements of mathematical objects. In the enumeration Weihrauch (eW) degrees we follow a similar idea, but our names may only carry positive information. It turns out that this coding by positive information separates several choice problems that are equivalent in the Weihrauch degrees, and in this talk we look at some of the more striking examples and their proofs. We close with some discussion of various directions for further research.
 
=== '''November 20 - Logan Heath ''' ===
'''Title:''' A Proof Theorist's Guide to First Aid: CUT-Elimination and Other Results of Classical Proof Theory ([https://wiki.math.wisc.edu/images/A_Proof_Theorist%27s_Guide_to_First_Aid.pdf Slides])
 
'''Abstract:''' When are correct proofs also "bad" proofs, how can we avoid them, and should we even try? In this talk we examine some early results of classical proof theory regarding the consistency of the sequent calculus for FOL and '''PA'''. In both cases our approach will be to avoid proofs which are technically correct, but also defective in some sense.
 
=== November 27 - Thanksgiving Break ===
=== '''December 4 - Mei Rose Connor ''' ===
'''Title:''' When ‘And’ is Too Much and ‘Or’ is Not Enough
 
'''Abstract:''' This work was motivated by the seven–valued predication system of the Jaina religion, which states that no statement exists as an absolute. This system, known as ''Saptabhangivada'' in Sanskrit, has 7 truth values that are the non-empty subsets of the set {asti, nāsti, avaktavyah}. These words translate to: ''it is'', ''it is not'', and ''it is unassertible'', respectively. This talk will explore how these seven truth values relate to each other, the problems encountered when trying to formalise this system, and the author’s current resolution of said problems using lattice theory and introducing an eighth truth value.
 
=== '''December 11 - NO MEETING''' ===
Note: The originally scheduled talk has been moved to Tuesday, December 12 (at the usual logic seminar time&location). See https://people.math.wisc.edu/logic/seminar.html for more details.


Bjarki Gunnarsson  will present Sections 2.6 and 2.7


<!-- 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 14:49, 14 October 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


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