# Computability Learning Seminar

Wednesday, January 23, 2019 — 3:30 PM EST

Mohammad Mahmoud, Department of Pure Mathematics, University of Waterloo

"The Isomorphism Problem for Pregeometries"

We will talk about the isomorphism problem for classes of r.i.c.e.  pregeometries. By a r.i.c.e. pregeometry we mean a computable structure $\mathcal{M}$ equipped with a r.i.c.e.  operator $cl^{\mathcal{M}}$ such that $(\mathcal{M},cl^{\mathcal{M}})$ is a pregeometry. The operator $cl^{\mathcal{M}}$ is called r.i.c.e. (relatively intrinsically computably enumerable)  if for every computable copy $(\mathcal{N},cl^{\mathcal{N}})$ of $(\mathcal{M},cl^{\mathcal{M}})$, $cl^{\mathcal{N}}$ is c.e. in $\mathcal{N}$. We will show that if $K$ is a class of r.i.c.e. pregeometries in which dependent elements are dense, then the isomorphism problem for the class $K$ is $\Pi^0_3$-hard.

MC 5413

### October 2021

S M T W T F S
26
27
28
29
30
1
2
3
4
7
9
10
11
12
13
14
15
16
17
18
21
22
23
24
25
30
31
1
2
3
4
5
6
1. 2021 (102)
1. October (15)
2. September (5)
3. August (15)
4. July (17)
5. June (15)
6. May (1)
7. April (4)
8. March (11)
9. February (9)
10. January (10)
2. 2020 (103)
1. December (10)
2. November (12)
3. October (4)
4. September (3)
5. August (1)
6. July (5)
7. June (1)
8. May (3)
9. March (16)
10. February (26)
11. January (22)
3. 2019 (199)
4. 2018 (212)
5. 2017 (281)
6. 2016 (335)
7. 2015 (211)
8. 2014 (235)
9. 2013 (251)
10. 2012 (135)