All talks will be in Keller Hall 314.
Thursday February 12
- 10:30-11:20am Olga Kharlampovich (CUNY — Hunter College): Elementary classification questions for groups and algebras I: Groups.
- 11:30am-1:20pm: CASUAL LUNCH. Suggestion: Manoa Gardens
- 1:30-2:20pm Free discussion
Friday February 13
- 9:30-10:20am Bakhadyr Khoussainov (University of Auckland):A quest for algorithmically random algebraic structures
- 11:30-12:20pm Alexei Miasnikov (Stevens Institute of Technology): Elementary classification questions for groups and algebras II: Associative and Lie algebras.
- 12:30-1:20pm BRIEF LUNCH. Suggestion: Sustainability Courtyard
- 1:30-2:20pm Paul Kim Long V. Nguyen (University of Hawaii — Leeward Community College): $\Sigma^0_3$-completeness of subdirect irreducibility
Abstract (Kharlampovich and Miasnikov)
We consider some fundamental model-theoretic questions that can be asked about a given algebraic structure (a group, a ring, etc.), or a class of structures, to understand its principal algebraic and logical properties. These Tarski type questions include: elementary classification and decidability of the first-order theory.
In the case of free groups we proved that two non-abelian free groups of different ranks are elementarily equivalent, classified finitely generated groups elementarily equivalent to a finitely generated free group (also done by Sela) and proved decidability of the first-order theory.
We describe partial solutions to Tarski’s problems in the class of free associative and Lie algebras of finite rank and some open problems. In particular, we will show that unlike free groups, two free associative algebras of finite rank over the same field are elementarily equivalent if and only if they are isomorphic. Two free associative algebras of finite rank over different infinite fields are elementarily equivalent if and only if the fields are equivalent in the weak second order logic, and the ranks are the same. We will also show that for an infinite field the theory of a free associative algebra is undecidable.