Главная
Study mode:
on
1
Introduction
2
Presburger arithmetic
3
Previous results
4
Presburger arithmetic extension
5
Results
6
Method
7
Visualizing
8
Fine mesh
9
Member
10
Encoding
11
Theorem
12
Decidability
13
Channels conjecture
14
Example
15
Channel conjecture
16
Boolean combination
17
Lemma
18
Proxy solution
Description:
Explore the decidability bounds of Presburger arithmetic extended by sine in this 46-minute seminar talk by Eion Blanchard from the University of Illinois at Urbana-Champaign. Delve into the Model Theory Seminar series, examining previous results and extensions of Presburger arithmetic. Gain insights into the methodology, including visualization techniques and fine mesh analysis. Discover the encoding process, theorem formulation, and decidability implications. Investigate the Channels conjecture with practical examples and explore Boolean combinations. Conclude with a discussion on proxy solutions and their relevance to the extended arithmetic system.

Decidability Bounds for Presburger Arithmetic Extended by Sine

Fields Institute
Add to list
0:00 / 0:00