• Home
  • Classification problems and models of arithmetic

Classification problems and models of arithmetic

Sourcetitle: 
Logikseminariet på GU
Year of publication: 
2010
PublicationType: 
Conference paper - non peer reviewed

I will introduce Borel reductions of equivalence relations. They are used to say how "hard" a certain classificaction problem is. This will then be used to prove theorems saying that the classification problems of countable models of arithmetic are hard indeed. The seminar will start from the very beginning of Borel reducability and end up in a recent paper by Coskey and Kossak.

http://engstrom.morot.org/material/logsem_2010_10_08.pdf

To the top

Page updated: 2012-01-30 14:02

Send as email
Print page
Show as pdf

X
Loading