Difference between revisions of "Graduate Logic Seminar"

From UW-Math Wiki
Jump to: navigation, search
(December 7 - John Spoerl)
(120 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, Uri Andrews ===
+
=== September 14 - organizational meeting ===
  
Title: Building Models of Strongly Minimal Theories - Part 1
+
We met to discuss the schedule.
  
Abstract: Since I'm talking in the Tuesday seminar as well, I'll use
+
=== September 28 - Ouyang Xiating ===
the Monday seminar talk to do some background on the topic and some
 
lemmas that will go into the proofs in Tuesday's talk. There will be
 
(I hope) some theorems of interest to see on both days, and both on
 
the general topic of answering the following question: What do you
 
need to know about a strongly minimal theory in order to compute
 
copies of all of its countable models. I'll start with a definition
 
for strongly minimal theories and build up from there.
 
  
=== February 12, James Hanson ===
+
Title: First-order logic, database and consistent query answering
  
Title: Finding Definable Sets in Continuous Logic
+
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: In order to be useful the notion of a 'definable set' in
+
=== October 12 - Karthik Ravishankar ===
continuous logic is stricter than a naive comparison to discrete logic
 
would suggest. As a consequence, even in relatively tame theories
 
there can be very few definable sets. For example, there is a
 
superstable theory with no non-trivial definable sets. As we'll see,
 
however, there are many definable sets in omega-stable,
 
omega-categorical, and other small theories.
 
  
=== February 19, Noah Schweber ===
+
Title: Notions of randomness for subsets of the Natural Numbers
  
Title: Proper forcing
+
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: Although a given forcing notion may have nice properties on
+
=== October 26 - no seminar ===
its own, those properties might vanish when we apply it repeatedly.
 
Early preservation results (that is, theorems saying that the
 
iteration of forcings with a nice property retains that nice property)
 
were fairly limited, and things really got off the ground with
 
Shelah's invention of "proper forcing." Roughly speaking, a forcing is
 
proper if it can be approximated by elementary submodels of the
 
universe in a particularly nice way. I'll define proper forcing and
 
sketch some applications.
 
  
=== February 26, Patrick Nicodemus ===
+
=== November 9 - Antonio Nákid Cordero ===
  
Title: A survey of computable and constructive mathematics in economic history
+
Title: Martin's Conjecture: On the uniqueness of the Turing jump
  
=== March 5, Tamvana Makulumi ===
+
Abstract: The partial order of the Turing degrees is well-known to be extremely complicated. However, all the Turing degrees that appear "naturally" in mathematics turn out to be well-ordered. In the '70s, Martin made a sharp conjecture explaining this phenomenon, the prime suspect: the Turing jump. This talk will explore the precise statement of Martin's conjecture and the interesting mathematics that surround it.
  
Title: Convexly Orderable Groups
+
=== November 23 - Antonio Nákid Cordero ===
  
=== March 12, Dan Turetsky (University of Notre Dame) ===
+
Title: Two Perspectives on Martin's Conjecture.
  
Title: Structural Jump
+
Abstract: This time we will dive deeper into the recent developments around Martin's Conjecture. We will focus on two main themes: the uniformity assumption, and the interaction of Martin's conjecture with the theory of countable Borel equivalence relations.
  
=== March 19, Ethan McCarthy ===
+
=== December 7 - John Spoerl ===
  
Title: Networks and degrees of points in non-second countable spaces
+
Title: Cardinals Beyond Choice and Inner Model Theory
  
=== April 2, Wil Cocke ===
+
Abstract: This talk will be a general introduction and overview of large cardinal axioms which violate the axiom of choice and their impact on the project of inner model theory.
  
Title: Characterizing Finite Nilpotent Groups via Word Maps
+
== Previous Years ==
  
Abstract: In this talk, we will examine a novel characterization of finite
+
The schedule of talks from past semesters can be found [[Graduate Logic Seminar, previous semesters|here]].
nilpotent groups using the probability distributions induced by word
 
maps. In particular we show that a finite group is nilpotent if and
 
only if every surjective word map has fibers of uniform size.
 
 
 
=== April 9, Tejas Bhojraj ===
 
 
 
Title: Quantum Randomness
 
 
 
Abstract: I will read the paper by Nies and Scholz where they define a notion of
 
algorithmic randomness for infinite sequences of quantum bits
 
(qubits). This talk will cover the basic notions of quantum randomness
 
on which my talk on Tuesday will be based.
 
 
 
=== 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 14:25, 3 December 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 - no seminar

November 9 - Antonio Nákid Cordero

Title: Martin's Conjecture: On the uniqueness of the Turing jump

Abstract: The partial order of the Turing degrees is well-known to be extremely complicated. However, all the Turing degrees that appear "naturally" in mathematics turn out to be well-ordered. In the '70s, Martin made a sharp conjecture explaining this phenomenon, the prime suspect: the Turing jump. This talk will explore the precise statement of Martin's conjecture and the interesting mathematics that surround it.

November 23 - Antonio Nákid Cordero

Title: Two Perspectives on Martin's Conjecture.

Abstract: This time we will dive deeper into the recent developments around Martin's Conjecture. We will focus on two main themes: the uniformity assumption, and the interaction of Martin's conjecture with the theory of countable Borel equivalence relations.

December 7 - John Spoerl

Title: Cardinals Beyond Choice and Inner Model Theory

Abstract: This talk will be a general introduction and overview of large cardinal axioms which violate the axiom of choice and their impact on the project of inner model theory.

Previous Years

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