|(120 intermediate revisions by 6 users not shown)|
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 and professors present topics related to logic which are not original or completed work. This is space principally practicing presentation skills or learning materials that are not usually presented a class.
Mondays, 4 :00 PM – 5 :00 PM (unless otherwise announced).
* '''When:''' 45 PM
* '''Where:''' Van Vleck
B235 (unless otherwise announced).
* '''Where:''' Van Vleck
* '''Organizers:''' [https://www.math.wisc.edu/~
msoskova/ Mariya Soskava]
* '''Organizers:''' [https://www.math.wisc.edu/~/ ]
Talks schedule are arrange and decide at the beginning of each semester. If you would like to participate, please contact one of the organizers.
schedule at the beginning of each semester. If you would like to participate, please contact one of the organizers.
== Spring 2018 ==
= January 29, Organizational meeting ===
This day we decided the schedule for the semester.
February 5, Uri Andrews ===
Title: Building Models of Strongly Minimal Theories - Part 1
Abstract: Since I'm talking in the Tuesday seminar as well, I'll use
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: Finding Definable Sets in Continuous Logic
Abstract: In order to be useful the notion of a 'definable set' in
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: Proper forcing
Abstract: Although a given forcing notion may have nice properties on
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 ===
A survey of computable and constructive mathematics in economic history
=== March 5, Tamvana Makulumi ===
Title: Convexly Orderable Groups
=== March 12, Dan Turetsky (University of Notre Dame) ===
Title: Structural Jump
March 19, Ethan McCarthy ===
Networks and degrees of points in non-second countable spaces
=== April 2, Wil Cocke ===
Title: Characterizing Finite Nilpotent Groups via Word Maps
Abstract: In this talk, we will examine a novel characterization of finite
The schedule of talks from past semesters can be found [[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) ===
=== April 30, [http://www.math.uconn.edu/~westrick/ Linda Brown Westrick] (from University Of Connecticut) ===
=== May 7, TBA ===
== Fall 2017 ==
=== September 11, Organizational meeting ===
This day we decided the schedule for the semester.
=== September 18, (person) ===
=== September 25, (Person) ===
=== October 2, (Person) ===
=== October 9, (Person) ===
=== October 16, (Person) ===
=== October 23, (Person) ===
=== October 30, Iván Ongay-Valverde ===
=== November 6, (Person) ===
=== November 13, (Person) ===
=== November 20, (Person) ===
=== November 27, (Person) ===
=== December 4, (Person) ===
=== December 11, (Person) ===
The schedule of talks from past semesters can be found [[Logic
Graduate Seminar, previous semesters|here]].
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: firstname.lastname@example.org
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.
The schedule of talks from past semesters can be found here.