[FOM] From Compactness to Completeness

Panu Raatikainen panu.raatikainen at helsinki.fi
Fri Dec 24 23:48:41 EST 2010

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

E-mail: panu.raatikainen at helsinki.fi

More information about the FOM mailing list