# Graduate Logic Seminar: Difference between revisions

(Added tentative schedule) |
No edit summary |
||

Line 18: | Line 18: | ||

=== September 16 - Daniel Belin I === | === September 16 - Daniel Belin I === | ||

Title: Lattice Embeddings of the m-Degrees and Second Order Arithmetic | |||

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

=== September 23 - Daniel Belin II === | === September 23 - Daniel Belin II === |

## Revision as of 22:35, 9 September 2019

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.

**When:**Mondays 4p-5p**Where:**TBD.**Organizers:**Omer Mermelstein

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 2019 - Tentative schedule

### September 5 - Organizational meeting

### September 9 - No seminar

### September 16 - Daniel Belin I

Title: Lattice Embeddings of the m-Degrees and Second Order Arithmetic

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.

### September 23 - Daniel Belin II

### September 30 - Josiah Jacobsen-Grocott I - Date may change

### October 7 - Josiah Jacobsen-Grocott II

### October 14 - Tejas Bhojraj I - Date may change

### October 21 - Tejas Bhojraj II - Date may change

### October 28 - Two short talks

Speakers TBD

### November 4 - Two short talks

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 here.