# Graduate Logic Seminar: Difference between revisions

(131 intermediate revisions by 9 users not shown) | |||

Line 1: | Line 1: | ||

The Graduate Logic Seminar is an informal space where graduate | 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 | * '''When:''' Mondays 3:30-4:30 PM | ||

* '''Where:''' Van Vleck | * '''Where:''' Van Vleck B223 | ||

* '''Organizers:''' [https:// | * '''Organizers:''' [https://uriandrews.netlify.app/ Uri Andrews] and [https://sites.google.com/view/hongyu-zhu/ Hongyu Zhu] | ||

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 one of 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 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 [mailto:andrews@math.wisc.edu Uri Andrews] and [mailto:hongyu@math.wisc.edu 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 <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 === | |||

We will meet to assign speakers to dates. | |||

=== '''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]) | |||

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

<!-- Template | |||

== | === '''September 18 - Karthik Ravishankar''' === | ||

'''Title:''' Lowness for Isomorphism ([https://wiki.math.wisc.edu/images/Karthik_talk.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. | |||

--> | |||

== 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 14:45, 20 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.

**When:**Mondays 3:30-4:30 PM**Where:**Van Vleck B223**Organizers:**Uri Andrews and Hongyu Zhu

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.

## Previous Years

The schedule of talks from past semesters can be found here.