Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
No edit summary
(102 intermediate revisions by 5 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:''' Fridays, 3:30 PM - 4:30 PM (unless otherwise announced).
* '''When:''' Tuesdays 4-5 PM
* '''Where:''' Van Vleck B115 (unless otherwise announced).
* '''Where:''' Van Vleck 901
* '''Organizers:''' [https://www.math.wisc.edu/~schweber/ Noah Schweber]
* '''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.


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


=== September 7, 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]].


=== September 14, [https://sites.google.com/a/wisc.edu/schweber/ Noah Schweber] ===
=== September 14 - organizational meeting ===


Title:
We met to discuss the schedule.


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


=== September 21, ===
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 ===


=== October 28,  ===
Title: Notions of randomness for subsets of the Natural Numbers


Title:
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.


Abstract:
=== October 26 - Alice Vidrine ===


=== October 5,  ===
=== November 9 - Antonio Nákid Cordero ===


Title:
=== November 23 - Antonio Nákid Cordero? ===


Abstract:
=== December 7 - John Spoerl ===


=== October 12,  ===
== Previous Years ==
 
Title:
 
Abstract:
 
=== October 19,  ===
 
Title:
 
Abstract:
 
=== October 26,  ===
 
Title:
 
Abstract:
 
=== November 2,  ===
 
Title:
 
Abstract:
 
=== November 9,  ===
 
Title:
 
Abstract:
 
=== November 16,  ===
 
Title:
 
Abstract:
 
=== November 23,  ===
 
Title:
 
Abstract:
 
=== November 30,  ===
 
Title:
 
Abstract:
 
=== December 7,  ===
 
Title:
 
Abstract:
 
=== December 14, ===
 
Title:
 
Abstract:
 
=== December 21, ===
 
Title:
 
Abstract:
 
==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 20:10, 13 October 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

Title: Notions of randomness for subsets of the Natural Numbers

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 26 - Alice Vidrine

November 9 - Antonio Nákid Cordero

November 23 - Antonio Nákid Cordero?

December 7 - John Spoerl

Previous Years

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