Mardi 4 juin :
Arman Darbinyan (ENS), Computability, orders, and
groups
Orderable groups are extensively studied by logicians and group theorists. In my talk I will address aspects of left- or bi-orderable groups that are connected with computability theory. In particular, I will talk about constructions of bi-orderable computable groups that cannot be embedded into groups with computable bi-order. I will also discuss our recent work in progress with M. Steenbock about simplicity and computably left-orderability.
Exposés précédents : Années 99 - 00,
00 - 01,
01 - 02,
02 - 03,
03 - 04,
04 - 05,
05 - 06,
06 - 07,
07 - 08,
08 - 09,
09 - 10,
10 - 11,
11 - 12,
12 - 13,
13 - 14,
14 - 15,
15 - 16,
16 - 17,
17 - 18
18 - 19.