Difference between revisions of "Graduate Logic Seminar"
(→Spring 2021 - Tentative schedule) |
|||
(95 intermediate revisions by 5 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:''' | + | * '''When:''' TBA |
− | * '''Where:''' | + | * '''Where:''' on line (ask for code). |
− | * '''Organizers:''' [https://www.math.wisc.edu/~ | + | * '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ Jun Le Goh] |
− | + | 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 | |
− | == | + | == Spring 2021 - Tentative schedule == |
− | + | === February 16 3:30PM - Short talk by Sarah Reitzes (University of Chicago) === | |
− | + | Title: Reduction games over $\mathrm{RCA}_0$ | |
− | + | Abstract: In this talk, I will discuss joint work with Damir D. Dzhafarov and Denis R. Hirschfeldt. Our work centers on the characterization of problems P and Q such that P $\leq_{\omega}$ Q, as well as problems P and Q such that $\mathrm{RCA}_0 \vdash$ Q $\to$ P, in terms of winning strategies in certain games. These characterizations were originally introduced by Hirschfeldt and Jockusch. I will discuss extensions and generalizations of these characterizations, including a certain notion of compactness that allows us, for strategies satisfying particular conditions, to bound the number of moves it takes to win. This bound is independent of the instance of the problem P being considered. This allows us to develop the idea of Weihrauch and generalized Weihrauch reduction over some base theory. Here, we will focus on the base theory $\mathrm{RCA}_0$. In this talk, I will explore these notions of reduction among various principles, including bounding and induction principles. | |
− | + | === March 23 4:15PM - Steffen Lempp === | |
− | + | Title: Degree structures and their finite substructures | |
− | + | Abstract: Many problems in mathematics can be viewed as being coded by sets of natural numbers (as indices). | |
+ | One can then define the relative computability of sets of natural numbers in various ways, each leading to a precise notion of “degree” of a problem (or set). | ||
+ | In each case, these degrees form partial orders, which can be studied as algebraic structures. | ||
+ | The study of their finite substructures leads to a better understanding of the partial order as a whole. | ||
− | + | === March 30 4PM - Alice Vidrine === | |
− | + | Title: Categorical logic for realizability, part I: Categories and the Yoneda Lemma | |
− | + | Abstract: An interesting strand of modern research on realizability--a semantics for non-classical logic based on a notion of computation--uses the language of toposes and Grothendieck fibrations to study mathematical universes whose internal notion of truth is similarly structured by computation. The purpose of this talk is to establish the basic notions of category theory required to understand the tools of categorical logic developed in the sequel, with the end goal of understanding the realizability toposes developed by Hyland, Johnstone, and Pitts. The talk will cover the definitions of category, functor, natural transformation, adjunctions, and limits/colimits, with a heavy emphasis on the ubiquitous notion of representability. | |
− | + | [https://hilbert.math.wisc.edu/wiki/images/Cat-slides-1.pdf Link to slides] | |
− | === | + | === April 27 4PM - Alice Vidrine === |
− | Title: | + | Title: Categorical logic for realizability, part II |
− | Abstract: | + | Abstract: Realizability is an approach to semantics for non-classical logic that interprets propositions by sets of abstract computational data. One modern approach to realizability makes heavy use of the notion of a topos, a type of category that behaves like a universe of non-standard sets. In preparation for introducing realizability toposes, the present talk will be a brisk introduction to the notion of a topos, with an emphasis on their logical aspects. In particular, we will look at the notion of a subobject classifier and the internal logic to which it gives rise. |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
==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]]. |
Revision as of 12:48, 21 April 2021
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: TBA
- Where: on line (ask for code).
- Organizers: Jun Le Goh
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
Contents
Spring 2021 - Tentative schedule
February 16 3:30PM - Short talk by Sarah Reitzes (University of Chicago)
Title: Reduction games over $\mathrm{RCA}_0$
Abstract: In this talk, I will discuss joint work with Damir D. Dzhafarov and Denis R. Hirschfeldt. Our work centers on the characterization of problems P and Q such that P $\leq_{\omega}$ Q, as well as problems P and Q such that $\mathrm{RCA}_0 \vdash$ Q $\to$ P, in terms of winning strategies in certain games. These characterizations were originally introduced by Hirschfeldt and Jockusch. I will discuss extensions and generalizations of these characterizations, including a certain notion of compactness that allows us, for strategies satisfying particular conditions, to bound the number of moves it takes to win. This bound is independent of the instance of the problem P being considered. This allows us to develop the idea of Weihrauch and generalized Weihrauch reduction over some base theory. Here, we will focus on the base theory $\mathrm{RCA}_0$. In this talk, I will explore these notions of reduction among various principles, including bounding and induction principles.
March 23 4:15PM - Steffen Lempp
Title: Degree structures and their finite substructures
Abstract: Many problems in mathematics can be viewed as being coded by sets of natural numbers (as indices). One can then define the relative computability of sets of natural numbers in various ways, each leading to a precise notion of “degree” of a problem (or set). In each case, these degrees form partial orders, which can be studied as algebraic structures. The study of their finite substructures leads to a better understanding of the partial order as a whole.
March 30 4PM - Alice Vidrine
Title: Categorical logic for realizability, part I: Categories and the Yoneda Lemma
Abstract: An interesting strand of modern research on realizability--a semantics for non-classical logic based on a notion of computation--uses the language of toposes and Grothendieck fibrations to study mathematical universes whose internal notion of truth is similarly structured by computation. The purpose of this talk is to establish the basic notions of category theory required to understand the tools of categorical logic developed in the sequel, with the end goal of understanding the realizability toposes developed by Hyland, Johnstone, and Pitts. The talk will cover the definitions of category, functor, natural transformation, adjunctions, and limits/colimits, with a heavy emphasis on the ubiquitous notion of representability.
April 27 4PM - Alice Vidrine
Title: Categorical logic for realizability, part II
Abstract: Realizability is an approach to semantics for non-classical logic that interprets propositions by sets of abstract computational data. One modern approach to realizability makes heavy use of the notion of a topos, a type of category that behaves like a universe of non-standard sets. In preparation for introducing realizability toposes, the present talk will be a brisk introduction to the notion of a topos, with an emphasis on their logical aspects. In particular, we will look at the notion of a subobject classifier and the internal logic to which it gives rise.
Previous Years
The schedule of talks from past semesters can be found here.