Difference between revisions of "Graduate Logic Seminar"

From UW-Math Wiki
Jump to navigation Jump to search
(27 intermediate revisions by 4 users not shown)
Line 1: Line 1:
 
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 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:''' Tuesdays 4-5 PM
+
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' Van Vleck 901
+
* '''Where:''' Van Vleck B139
* '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ Jun Le Goh]
+
* '''Organizers:''' Karthik Ravishankar and [https://sites.google.com/wisc.edu/antonio Antonio Nakid Cordero]
  
 
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.
Line 9: Line 9:
 
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:  join-grad-logic-sem@lists.wisc.edu
  
== Fall 2021 tentative schedule ==
+
== Fall 2022 ==
  
To see what's happening in the Logic qual preparation sessions click [[Logic Qual Prep|here]].
+
=== September 12 - Organizational Meeting ===
  
=== September 14 - organizational meeting ===
+
We will meet to assign speakers to dates.
  
We met to discuss the schedule.
+
=== '''September 19 - Karthik Ravishankar''' ===
 +
TItle: '''Lowness for Isomorphism'''
  
=== September 28 - Ouyang Xiating ===
+
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.
  
Title: First-order logic, database and consistent query answering
+
=== '''September 26 - Antonio Nakid Cordero''' ===
  
Abstract: Databases are a crucial component of many (if not all) modern
+
=== '''October 3 - Yunting Zhang''' ===
applications. In reality, the data stored are often dirty and contain
 
duplicated/missing entries, and it is a natural practice to clean the data
 
first before executing the query. However, the same query might return
 
different answers on different cleaned versions of the dataset. It is then
 
helpful to compute the consistent answers: the query answers that will always
 
be returned, regardless of how the dirty data is cleaned. In this talk, we
 
first introduce the connection between first-order logic and query languages
 
on databases, and then discuss the problem of Consistent Query Answering
 
(CQA): How to compute consistent answers on dirty data? Finally, we show
 
when the CQA problem can be solved using first-order logic for path queries.
 
  
=== October 12 - Karthik Ravishankar ===
+
=== '''October 10 - Yuxiao Fu''' ===
  
Title: Notions of randomness for subsets of the Natural Numbers
+
=== '''October 17 - Alice Vidrine''' ===
  
Abstract: There are a number of notions of randomness of sets of natural numbers. These notions have been defined based on what a 'random object' should behave like such as being 'incompressible' or being 'hard to predict' etc. There is often a interplay between computability and randomness aspects of subsets of natural numbers. In this talk we motivate and present a few different notions of randomness and compare their relative strength.
+
=== '''October 24 - Hongyu Zhu''' ===
  
=== October 26 - Alice Vidrine ===
+
=== '''October 31 - Break for Halloween''' ===
  
Title: Categorical logic for realizability, part III: Actual realizability
+
=== '''November 7 - John Spoerl''' ===
  
Abstract: Realizability is an approach to semantics for non-classical logic that interprets propositions by sets of abstract computational data. In the present talk we describe the notion of a Schonfinkel algebra (also called a partial combinatory algebra), which gives us a very general notion of computation. We then describe the construction of a topos whose notions of morphism and subobject must respect the computational structure, and describe the unusual features of these toposes, closing with some discussion of Lawvere-Tierney topologies on such toposes.
+
=== '''November 14 - Josiah Jacobsen-Grocott''' ===
  
(The abstracts for parts I and II, which were given in spring 2021, can be found [https://hilbert.math.wisc.edu/wiki/index.php/Graduate_Logic_Seminar,_previous_semesters#March_30_4PM_-_Alice_Vidrine here].)
+
=== '''November 21 - Karthik Ravishankar''' ===
  
=== November 9 - Antonio Nákid Cordero ===
+
=== '''November 28 - Logan Heath''' ===
  
=== November 23 - Antonio Nákid Cordero? ===
+
=== '''December 5 - Logan Heath''' ===
  
=== December 7 - John Spoerl ===
+
=== '''December 12 - TBA''' ===
  
 
== 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 01:39, 19 September 2022

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 B139
  • Organizers: Karthik Ravishankar and Antonio Nakid Cordero

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 2022

September 12 - Organizational Meeting

We will meet to assign speakers to dates.

September 19 - Karthik Ravishankar

TItle: Lowness for Isomorphism

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.

September 26 - Antonio Nakid Cordero

October 3 - Yunting Zhang

October 10 - Yuxiao Fu

October 17 - Alice Vidrine

October 24 - Hongyu Zhu

October 31 - Break for Halloween

November 7 - John Spoerl

November 14 - Josiah Jacobsen-Grocott

November 21 - Karthik Ravishankar

November 28 - Logan Heath

December 5 - Logan Heath

December 12 - TBA

Previous Years

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