[FOM] From Compactness to Completeness

[Panu Raatikainen]

Lainaus T.Forster at dpmms.cam.ac.uk:

> I think if the language is countable you don'tneed KL, surely?

Presumably you need at least WKL, the Weak König's Lemma (i.e. KL for  
binary trees), for it is a basic fact in Reverse Math that the  
completeness theorem is equivalent with WKL.

Best, Panu




-- 
Panu Raatikainen

Ph.D., Docent in Theoretical Philosophy

Department of Philosophy, History, Culture and Art Studies
P.O. Box 24  (Unioninkatu 38 A)
FIN-00014 University of Helsinki
Finland

E-mail: panu.raatikainen at helsinki.fi
http://www.mv.helsinki.fi/home/praatika/