Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
VisualWikitext
No edit summary
(198 intermediate revisions by 11 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 B223
* '''Organizers:''' [https://www.math.wisc.edu/~msoskova/ Mariya Soskava]
* '''Organizers:''' [https://uriandrews.netlify.app/ Uri Andrews] and [https://sites.google.com/view/hongyu-zhu/ Hongyu Zhu]


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 one of 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 2023 ==


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


=== February 5, Uri Andrews ===
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.


Title: Building Models of Strongly Minimal Theories - Part 1
Presentation Schedule: https://docs.google.com/spreadsheets/d/15Qd4EzrrKpn1Ct5tur1P_FDc2czsdAVnUf_pfp65Lb4/edit?usp=sharing


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 ===
Possible readings:
* (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.


Title: Finding Definable Sets in Continuous Logic
=== September 11 - Organizational Meeting ===


Abstract: In order to be useful the notion of a 'definable set' in
We will meet to assign speakers to dates.
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 18 - Taeyoung Em''' ===
'''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])


Title: Proper forcing
'''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.


Abstract: Although a given forcing notion may have nice properties on
=== '''September 25 - Karthik Ravishankar''' ===
its own, those properties might vanish when we apply it repeatedly.
'''Title:''' Spectra of structures
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 ===
'''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.


Title: A survey of computable and constructive mathematics in economic history
=== '''October 2 - Hongyu Zhu''' ===
'''Title:''' Continuum Hypothesis: On Platonism and Pluralism


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


Title: Convexly Orderable Groups
<!-- Template


=== March 12, Dan Turetsky (University of Notre Dame) ===
=== '''September 18 - Karthik Ravishankar''' ===
'''Title:''' Lowness for Isomorphism ([https://wiki.math.wisc.edu/images/Karthik_talk.pdf Slides])


Title: Structural Jump
'''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.


=== March 19, Ethan McCarthy ===
-->


Title: Networks and degrees of points in non-second countable spaces
== Previous Years ==


=== April 2, Wil Cocke ===
The schedule of talks from past semesters can be found [[Graduate Logic Seminar, previous semesters|here]].
 
Title: Characterizing Finite Nilpotent Groups via Word Maps
 
Abstract: In this talk, we will examine a novel characterization of finite
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 ===
 
Title: Quantum Randomness
 
Abstract: I will read the paper by Nies and Scholz where they define a notion of
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] ===
 
Title: What can we say about sets made by the union of Turing equivalence classes?
 
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.
 
This is a work in progress, so this talk will have multiple open questions and opportunities for feedback and public participation (hopefully).
 
=== April 23, [http://www.math.wisc.edu/~mccarthy/ Ethan McCarthy] (Thesis Defense) ===
 
Title: TBA
 
Abstract: TBA
 
=== April 30, [http://www.math.uconn.edu/~westrick/ Linda Brown Westrick] (from University Of Connecticut) ===
 
Title: TBA
 
Abstract: TBA
 
=== 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]].

Revision as of 16:20, 26 September 2023

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

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

Fall 2023

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 Uri Andrews and Hongyu Zhu.

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/15Qd4EzrrKpn1Ct5tur1P_FDc2czsdAVnUf_pfp65Lb4/edit?usp=sharing

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

Possible readings:

  • (Elementary) Proof Theory: Chapters 4-7 of Aspects of Incompleteness by Per Lindström.
  • An invitation to model-theoretic Galois theory. On arxiv here.
  • Variations on the Feferman-Vaught Theorem On arxiv here.
  • 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

We will meet to assign speakers to dates.

September 18 - Taeyoung Em

Title: Explicit construction of non-quasidetermined game on [math]\displaystyle{ \mathcal P(2^{\mathbb N}) }[/math] without using A.C. (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]\displaystyle{ \mathcal P(2^{\mathbb N}) }[/math] without using A.C.

September 25 - Karthik Ravishankar

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.

October 2 - Hongyu Zhu

Title: Continuum Hypothesis: On Platonism and Pluralism

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).


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