Difference between revisions of "Graduate Logic Seminar"

From UW-Math Wiki
Jump to navigation Jump to search
 
(114 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 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:''' Mondays 4p-5p
+
* '''When:''' Mondays 3:30-4:30 PM
* '''Where:''' Van Vleck B223.
+
* '''Where:''' Van Vleck B139
* '''Organizers:''' [https://www.math.wisc.edu/~omer/ Omer Mermelstein]
+
* '''Organizers:''' Karthik Ravishankar and [https://sites.google.com/wisc.edu/antonio Antonio Nakid Cordero]
  
 
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 one of the organizers.
Line 9: Line 9:
 
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:  join-grad-logic-sem@lists.wisc.edu
  
 +
== Fall 2022 ==
  
 +
=== September 12 - Organizational Meeting ===
  
== Fall 2019 - Tentative schedule ==
+
We will meet to assign speakers to dates.
  
=== September 5 - Organizational meeting ===
+
=== '''September 19 - Karthik Ravishankar''' ===
 +
'''Title:''' Lowness for Isomorphism
  
=== September 9 - No seminar ===
+
'''Abstract:''' A Turing degree is said to be low for isomorphism if it can only compute an isomorphism between computable structures only when a computable isomorphism already exists. In this talk, we show that the measure of the class of low for isomorphism sets in Cantor space is 0 and that no Martin Lof random is low for isomorphism.
  
=== September 16 - Daniel Belin ===
+
=== '''September 26 - Antonio Nakid Cordero''' ===
Title: Lattice Embeddings of the m-Degrees and Second Order Arithmetic
+
'''Title:''' When Models became Polish: an introduction to the Topological Vaught Conjecture
  
Abstract: Lachlan, in a result later refined and clarified by Odifreddi, proved in 1970 that initial segments of the m-degrees can be embedded as an upper semilattice formed as the limit of finite distributive lattices. This allows us to show that the many-one degrees codes satisfiability in second-order arithmetic, due to a later result of Nerode and Shore. We will take a journey through Lachlan's rather complicated construction which sheds a great deal of light on the order-theoretic properties of many-one reducibility.
+
'''Abstract:''' Vaught's Conjecture, originally asked by Vaught in 1961, is one of the most (in)famous open problems in mathematical logic. The conjecture is that a complete theory on a countable language must either have countably-many or continuum-many non-isomorphic models. In this talk, we will discuss some of the main ideas that surround this conjecture, with special emphasis on a topological generalization in terms of the continuous actions of Polish groups.
  
=== September 23 - Daniel Belin ===
+
=== '''October 3 - Yunting Zhang''' ===
  
Title: Lattice Embeddings of the m-Degrees and Second Order Arithmetic - Continued
+
=== '''October 10 - Yuxiao Fu''' ===
  
=== September 30 - Josiah Jacobsen-Grocott ===
+
=== '''October 17 - Alice Vidrine''' ===
  
Title: Scott Rank of Computable Models
+
=== '''October 24 - Hongyu Zhu''' ===
  
Abstract: Infinatary logic extends the notions of first order logic by allowing infinite formulas. Scott's Isomorphism Theorem states that any countable structure can be characterized up to isomorphism by a single countable sentence. Closely related to the complexity of this sentence is what is known as the Scott Rank of the structure. In this talk we restrict our attention to computable models and look at an upper bound on the Scott Rank of such structures.
+
=== '''October 31 - Break for Halloween''' ===
  
=== October 7 - Josiah Jacobsen-Grocott ===
+
=== '''November 7 - John Spoerl''' ===
  
Title: Scott Rank of Computable Codels - Continued
+
=== '''November 14 - Josiah Jacobsen-Grocott''' ===
  
=== October 14 - Tejas Bhojraj I ===
+
=== '''November 21 - Karthik Ravishankar''' ===
  
=== October 21 - Tejas Bhojraj II ===
+
=== '''November 28 - Logan Heath''' ===
  
=== October 28 - Two short talks ===
+
=== '''December 5 - Logan Heath''' ===
  
Iván Ongay Valverde and James Earnest Hanson
+
=== '''December 12 - TBA''' ===
  
=== November 4 - Two short talks ===
+
== Previous Years ==
Speakers TBD
 
 
 
=== November 11 - Manlio Valenti I ===
 
 
 
=== November 18 - Manlio Valenti II ===
 
 
 
=== November 25 - Two short talks ===
 
Speakers TBD
 
 
 
=== December 2 - Iván Ongay Valverde I ===
 
 
 
=== December 9 - Iván Ongay Valverde II ===
 
 
 
==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 02:20, 26 September 2022

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 B139
  • Organizers: Karthik Ravishankar and Antonio Nakid Cordero

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 2022

September 12 - Organizational Meeting

We will meet to assign speakers to dates.

September 19 - Karthik Ravishankar

Title: Lowness for Isomorphism

Abstract: A Turing degree is said to be low for isomorphism if it can only compute an isomorphism between computable structures only when a computable isomorphism already exists. In this talk, we show that the measure of the class of low for isomorphism sets in Cantor space is 0 and that no Martin Lof random is low for isomorphism.

September 26 - Antonio Nakid Cordero

Title: When Models became Polish: an introduction to the Topological Vaught Conjecture

Abstract: Vaught's Conjecture, originally asked by Vaught in 1961, is one of the most (in)famous open problems in mathematical logic. The conjecture is that a complete theory on a countable language must either have countably-many or continuum-many non-isomorphic models. In this talk, we will discuss some of the main ideas that surround this conjecture, with special emphasis on a topological generalization in terms of the continuous actions of Polish groups.

October 3 - Yunting Zhang

October 10 - Yuxiao Fu

October 17 - Alice Vidrine

October 24 - Hongyu Zhu

October 31 - Break for Halloween

November 7 - John Spoerl

November 14 - Josiah Jacobsen-Grocott

November 21 - Karthik Ravishankar

November 28 - Logan Heath

December 5 - Logan Heath

December 12 - TBA

Previous Years

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