## Contact Info

Pure MathematicsUniversity of Waterloo

200 University Avenue West

Waterloo, Ontario, Canada

N2L 3G1

Departmental office: MC 5304

Phone: 519 888 4567 x33484

Fax: 519 725 0160

Email: puremath@uwaterloo.ca

Visit our **COVID-19 Information website** for information on our response to the pandemic.

Please note: The University of Waterloo is closed for all events until further notice.

Thursday, August 27, 2015 — 2:00 PM EDT

**Michael Deveau, Department of Pure Mathematics, University of Waterloo **

“Embedding Lattices in the Computably Enumerable Degrees (Part 4)”

Thursday, August 20, 2015 — 2:00 PM EDT

**Michael Deveau, Department of Pure Mathematics, University of Waterloo **

“Embedding Lattices in the Computably Enumerable Degrees (Part 3)”

Wednesday, August 19, 2015 — 1:30 PM EDT

**Anthony McCormick, Pure Math Department, University of Waterloo **

“Iterated Function Systems with Overlap”

Friday, August 14, 2015 — 10:30 AM EDT

**Jim Haley, Pure Mathematics, University of Waterloo**

"Strongly Reductive Operators and Operator Algebras"

Thursday, August 13, 2015 — 2:00 PM EDT

**Jonny Stephenson, Pure Mathematics, University of Waterloo**

"Embedding Lattices in the Computably Enumerable Degrees (continued)"

This talk is a continuation of one given August 6th.

Thursday, August 13, 2015 — 10:30 AM EDT

**Ehsaan Hossain, Pure Mathematics, University of Waterloo**

"The Algebraic Kirchberg--Phillips Conjecture"

Wednesday, August 12, 2015 — 10:30 AM EDT

**Zack Cramer, Pure Mathematics, University of Waterloo**

** "**Approximation of Normal Operators by Nilpotents in Purely Infinite $C^*$-algebras"

Friday, August 7, 2015 — 10:30 AM EDT

**Sam Harris, Pure Mathematics, University of Waterloo**

"Kadison Similarity Problem and the Similarity Degree"

Thursday, August 6, 2015 — 2:00 PM EDT

Jonny Stephenson, Pure Mathematics, University of Waterloo

"Embedding Lattices into the Computably Enumerable Degrees"

The question of which finite lattices can be embedded into the c.e.

degrees first arose with the construction of a minimal pair by Yates,

and independently by Lachlan, showing the 4 element Boolean algebra

can be embedded. This result was rapidly generalised to show any

finite distributive lattice can also be embedded. For non-distributive

lattices, the situation is more complicated.

Tuesday, August 4, 2015 — 1:30 PM EDT

**Stanley Burris, Pure Mathematics, University of Waterloo**

"An Introduction to Boole's Algebra of Logic for Classes"

Boole's mysterious algebra of logic, based on the algebra of numbers and idempotent variables, has only been properly understood and justified in the last 40 years, more than a century after Boole published his most famous work, Laws of Thought. In this talk an elementary and natural development of Boole's system, from his partial algebra models up to his four main theorems, will be presented.

University of Waterloo

200 University Avenue West

Waterloo, Ontario, Canada

N2L 3G1

Departmental office: MC 5304

Phone: 519 888 4567 x33484

Fax: 519 725 0160

Email: puremath@uwaterloo.ca

University of Waterloo

University of Waterloo

43.471468

-80.544205

200 University Avenue West

Waterloo,
ON,
Canada
N2L 3G1