Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
No edit summary
 
(258 intermediate revisions by 12 users not shown)
Line 1: Line 1:
The Graduate Logic Seminar is an informal space where graduate student and professors present topics related to logic which are not necessarly original or completed work. This is an space focus principally in  practicing presentation skills or learning materials that are not usually presented on 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, 4:00 PM – 5:00 PM (unless otherwise announced).
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' Van Vleck B235 (unless otherwise announced).
* '''Where:''' Van Vleck B123
* '''Organizers:''' [https://www.math.wisc.edu/~msoskova/ Mariya Soskava]
* '''Organizer:''' Mariya Soskova


Talks schedule are arrange and decide 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.


== Spring 2018 ==
Sign up for the graduate logic seminar mailing list:  [mailto:join-grad-logic-sem@lists.wisc.edu join-grad-logic-sem@lists.wisc.edu]


=== January 29, Organizational meeting ===
== Fall 2024 ==


This day we decided the schedule for the semester.
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].


=== February 5, Uri Andrews ===
Presentation Schedule: [https://docs.google.com/spreadsheets/d/1ect-dgHdoHOgq4-5BGFiDh6pPThLfDg69Yg__-b_5RY/edit?usp=sharing Sign up here.]


Title: Building Models of Strongly Minimal Theories - Part 1
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.


Abstract: Since I'm talking in the Tuesday seminar as well, I'll use
<!--Zoom link for remote attendance: https://uwmadison.zoom.us/j/96168027763?pwd=bGdvL3lpOGl6QndQcG5RTFUzY3JXQT09 (Meeting ID: 961 6802 7763, Password: 975f23)-->
the Monday seminar talk to do some background on the topic and some
lemmas that will go into the proofs in Tuesday's talk. There will be
(I hope) some theorems of interest to see on both days, and both on
the general topic of answering the following question: What do you
need to know about a strongly minimal theory in order to compute
copies of all of its countable models. I'll start with a definition
for strongly minimal theories and build up from there.


=== February 12, James Hanson ===
=== '''September 9 - Organizational Meeting''' ===


Title: Finding Definable Sets in Continuous Logic
Mariya Soskova will start with the first sections from the notes.


Abstract: In order to be useful the notion of a 'definable set' in
We will then assign speakers to dates and topics.
continuous logic is stricter than a naive comparison to discrete logic
would suggest. As a consequence, even in relatively tame theories
there can be very few definable sets. For example, there is a
superstable theory with no non-trivial definable sets. As we'll see,
however, there are many definable sets in omega-stable,
omega-categorical, and other small theories.


=== February 19, Noah Schweber ===
=== '''September 16 -  Sections 1.2-1.4''' ===


Title: Proper forcing
Kanav Madhura will continue with Sections 1.2-1.4.


Abstract: Although a given forcing notion may have nice properties on
=== '''September 23 -  Sections 1.3-1.4 and 2.1-2.2''' ===
its own, those properties might vanish when we apply it repeatedly.
Early preservation results (that is, theorems saying that the
iteration of forcings with a nice property retains that nice property)
were fairly limited, and things really got off the ground with
Shelah's invention of "proper forcing." Roughly speaking, a forcing is
proper if it can be approximated by elementary submodels of the
universe in a particularly nice way. I'll define proper forcing and
sketch some applications.


=== February 26, Patrick Nicodemus ===
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.


Title: A survey of computable and constructive mathematics in economic history
=== '''September 30 -  Sections 2.2 and 2.3-2.5''' ===


=== March 5, Tamvana Makulumi ===
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''' ===


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


=== March 12, Dan Turetsky (University of Notre Dame) ===
=== '''October 14th -  Sections 2.6 and 2.7''' ===


Title: Structural Jump
Bjarki Gunnarsson  will present Sections 2.6 and 2.7


=== March 19, Ethan McCarthy ===
=== '''October 21th -  Section 3.1''' ===


Title: Networks and degrees of points in non-second countable spaces
Karthik Ravishankar will present Section 3.1 


=== April 2, Wil Cocke ===
=== '''October 28th -  Sections 3.2 and 3.3''' ===


Title: Characterizing Finite Nilpotent Groups via Word Maps
Karthik Ravishankar will finish Sections 3.2  and John Spoerl will begin Section 3.3


Abstract: In this talk, we will examine a novel characterization of finite
=== '''November 4th -  Sections 3.3 and 3.4''' ===
nilpotent groups using the probability distributions induced by word
maps. In particular we show that a finite group is nilpotent if and
only if every surjective word map has fibers of uniform size.


=== April 9, Tejas Bhojraj ===
John Spoerl will finish Sections 3.3 and 3.4


Title: Quantum Randomness
=== '''November 11th -  Section 4.1''' ===


Abstract: I will read the paper by Nies and Scholz where they define a notion of
Antonion Nakid-Cordero will present Section 4.1
algorithmic randomness for infinite sequences of quantum bits
(qubits). This talk will cover the basic notions of quantum randomness
on which my talk on Tuesday will be based.  


=== April 16, [http://www.math.wisc.edu/~ongay/ Iván Ongay-Valverde] ===
=== '''November 19th -  Sections 4.1 and 4.2''' ===


Title: What can we say about sets made by the union of Turing equivalence classes?
Start 4:00PM in VV901! Antonion Nakid-Cordero will continue with Section 4.1, Ang Li will begin Section 4.2.


Abstract: It is well known that given a real number x (in the real line) the set of all reals that have the same Turing degree (we will call this a Turing equivalence class) have order type 'the rationals' and that, unless x is computable, the set is not a subfield of the reals. Nevertheless, what can we say about the order type or the algebraic structure of a set made by the uncountable union of Turing equivalence classes?


This topic hasn't been deeply studied. In this talk I will focus principally on famous order types and answer whether they can be achieved or not. Furthermore, I will explain some possible connections with the automorphism problem of the Turing degrees.
=== '''November 25th -  Sections 4.2 and 4.3''' ===


This is a work in progress, so this talk will have multiple open questions and opportunities for feedback and public participation (hopefully).
Back to the usual time and place. Ang Li will begin Section 4.2.


=== April 23, [http://www.math.wisc.edu/~mccarthy/ Ethan McCarthy] (Thesis Defense) ===
<!-- Template


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


Abstract: TBA
'''Abstract:''' TBA


=== April 30, [http://www.math.uconn.edu/~westrick/ Linda Brown Westrick] (from University Of Connecticut) ===
-->


Title: TBA
== Previous Years ==


Abstract: TBA
The schedule of talks from past semesters can be found [[Graduate Logic Seminar, previous semesters|here]].
 
=== May 7, TBA ===
 
Title: TBA
 
Abstract: TBA
 
== Fall 2017 ==
 
=== September 11, Organizational meeting ===
 
This day we decided the schedule for the semester.
 
=== September 18, (person) ===
 
Title:
 
Abstract:
 
=== September 25, (Person) ===
 
Title:
 
Abstract:
 
=== October 2, (Person) ===
 
Title:
 
Abstract:
 
=== October 9, (Person) ===
 
Title:
 
Abstract:
 
=== October 16, (Person) ===
 
Title:
 
Abstract:
 
=== October 23, (Person) ===
 
Title:
 
Abstract:
 
=== October 30, Iván Ongay-Valverde ===
 
Title:
 
Abstract:
 
=== November 6, (Person) ===
 
Title:
 
Abstract:
 
=== November 13, (Person) ===
 
Title:
 
Abstract:
 
=== November 20, (Person) ===
 
Title:
 
Abstract:
 
=== November 27, (Person) ===
 
Title: TBA
 
Abstract: TBA
 
=== December 4, (Person) ===
 
Title: TBA
 
Abstract: TBA
 
=== December 11, (Person) ===
 
Title: TBA
 
Abstract: TBA
 
==Previous Years==
 
The schedule of talks from past semesters can be found [[Logic Graduate Seminar, previous semesters|here]].

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"