Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
No edit summary
(113 intermediate revisions by 6 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:''' Tuesdays 4-5 PM
* '''Where:''' Van Vleck B235 (unless otherwise announced).
* '''Where:''' Van Vleck 901
* '''Organizers:''' [https://www.math.wisc.edu/~msoskova/ Mariya Soskava]
* '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ Jun Le Goh]


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:  join-grad-logic-sem@lists.wisc.edu


=== January 29, Organizational meeting ===
== Fall 2021 tentative schedule ==


This day we decided the schedule for the semester.
To see what's happening in the Logic qual preparation sessions click [[Logic Qual Prep|here]].


=== February 5, (person) ===
=== September 14 - organizational meeting ===


Title:
We met to discuss the schedule.


Abstract:
=== September 28 - Ouyang Xiating ===


=== February 12, (Person) ===
Title: First-order logic, database and consistent query answering


Title:  
Abstract: Databases are a crucial component of many (if not all) modern
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.


Abstract:
=== October 12 - Karthik Ravishankar ===


=== February 19, (Person) ===
=== October 26 - Alice Vidrine ===


Title:
=== November 9 - Antonio Nákid Cordero ===


Abstract:
=== November 23 - open slot ===


=== February 26, (Person) ===
=== December 7 - open slot ===


Title:
== Previous Years ==


Abstract:
The schedule of talks from past semesters can be found [[Graduate Logic Seminar, previous semesters|here]].
 
=== March 5, (Person) ===
 
Title:
 
Abstract:
 
=== March 12, (Person) ===
 
Title:
 
Abstract:
 
=== March 19, (Person) ===
 
Title:
 
Abstract:
 
=== April 2, (Person) ===
 
Title:
 
Abstract:
 
=== April 9, (Person) ===
 
Title:
 
Abstract:
 
=== 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:43, 22 September 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: Tuesdays 4-5 PM
  • Where: Van Vleck 901
  • 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

Fall 2021 tentative schedule

To see what's happening in the Logic qual preparation sessions click here.

September 14 - organizational meeting

We met to discuss the schedule.

September 28 - Ouyang Xiating

Title: First-order logic, database and consistent query answering

Abstract: Databases are a crucial component of many (if not all) modern 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 26 - Alice Vidrine

November 9 - Antonio Nákid Cordero

November 23 - open slot

December 7 - open slot

Previous Years

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