Graduate Logic Seminar: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
mNo edit summary
 
(172 intermediate revisions by 9 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 B211
* '''Organizers:''' [https://www.math.wisc.edu/~jgoh/ Jun Le Goh]
* '''Organizer:''' Joseph Miller


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 the organizers.


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


== Fall 2021 tentative schedule ==
==Fall 2025==


To see what's happening in the Logic qual preparation sessions click [[Logic Qual Prep|here]].
The seminar will be run as a 1-credit seminar Math 975. In Fall 2025 students will present a logic topic of their choice (it could be original work, but does not have to be).  If you are not enrolled but would like to audit it, please contact [mailto:jmiller@math.wisc.edu Joe Miller].


=== September 14 - organizational meeting ===
Presentation Schedule: [https://docs.google.com/spreadsheets/d/1uRSaI1edJ5sepz57NV07ohIfBSKL9FgkvJvMAewk1ms/edit?usp=sharing Sign up here.]


We met to discuss the schedule.
<!--Zoom link for remote attendance: https://uwmadison.zoom.us/j/96168027763?pwd=bGdvL3lpOGl6QndQcG5RTFUzY3JXQT09 (Meeting ID: 961 6802 7763, Password: 975f23)-->


=== September 28 - Ouyang Xiating ===


Title: First-order logic, database and consistent query answering
==='''September 8 - Organizational Meeting'''===


Abstract: Databases are a crucial component of many (if not all) modern
We will meet to arrange the schedule
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 ===
==='''September 15 - Contrasting the halves of an Ahmad pair'''  ===
Abstract: We study Ahmad pairs in the $\Sigma^0_2$ enumeration degrees. We say $(A,B)$ form an Ahmad pair if $A \not \leq_e B$ and every $Z <_e A$ satisfies $Z \leq_e B$.  Ahmad pairs have recently drawn interest as they are a key obstacle in solving the $\forall\exists$ theory of the local structure.


Title: Notions of randomness for subsets of the Natural Numbers
In this talk we characterize the left halves of an Ahmad pair as precisely the low$_3$ and join irreducible degrees. We also show that right halves cannot be low$_3$. This is a natural separation between the two halves and is a significant strengthening of previous work.


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.
We then define a hierarchy of join irreducibility notions using which we characterize the left halves of Ahmad $n$-pairs as those that are low$_3$ and $n$-join irreducible. This allows us to extend and clarify previous work to show that for any $n$ there is a set $A$ which is the left half of an Ahmad $n$-pair but not of an Ahmad $(n+1)$-pair.


=== October 26 - no seminar ===
==='''September 22 -'''  ===


=== November 9 - Antonio Nákid Cordero ===
==='''September 29 -'''  ===
==='''October 6 -'''  ===


Title: Martin's Conjecture: On the uniqueness of the Turing jump
=== '''October 13 -''' ===


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.
==='''October 20 -''' ===


=== November 23 - Antonio Nákid Cordero ===
=== '''October 27 -''' ===


Title: Two Perspectives on Martin's Conjecture.
=== '''November 3 -''' ===


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.
==='''November 10 -'''  ===


=== December 7 - John Spoerl ===
==='''November 17 -'''  ===


Title: Cardinals Beyond Choice and Inner Model Theory
==='''November 24 -'''  ===


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.
==='''December 1 -'''  ===


== Previous Years ==
==='''December 8 -'''  ===
 
== 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]].

Latest revision as of 22:33, 13 September 2025

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 B211
  • Organizer: Joseph Miller

The talk schedule is arranged at the beginning of each semester. If you would like to participate, please contact the organizers.


Fall 2025

The seminar will be run as a 1-credit seminar Math 975. In Fall 2025 students will present a logic topic of their choice (it could be original work, but does not have to be). If you are not enrolled but would like to audit it, please contact Joe Miller.

Presentation Schedule: Sign up here.


September 8 - Organizational Meeting

We will meet to arrange the schedule

September 15 - Contrasting the halves of an Ahmad pair

Abstract: We study Ahmad pairs in the $\Sigma^0_2$ enumeration degrees. We say $(A,B)$ form an Ahmad pair if $A \not \leq_e B$ and every $Z <_e A$ satisfies $Z \leq_e B$.  Ahmad pairs have recently drawn interest as they are a key obstacle in solving the $\forall\exists$ theory of the local structure.

In this talk we characterize the left halves of an Ahmad pair as precisely the low$_3$ and join irreducible degrees. We also show that right halves cannot be low$_3$. This is a natural separation between the two halves and is a significant strengthening of previous work.

We then define a hierarchy of join irreducibility notions using which we characterize the left halves of Ahmad $n$-pairs as those that are low$_3$ and $n$-join irreducible. This allows us to extend and clarify previous work to show that for any $n$ there is a set $A$ which is the left half of an Ahmad $n$-pair but not of an Ahmad $(n+1)$-pair.

September 22 -

September 29 -

October 6 -

October 13 -

October 20 -

October 27 -

November 3 -

November 10 -

November 17 -

November 24 -

December 1 -

December 8 -

Previous Years

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