Available under Creative Commons-ShareAlike 4.0 International License. Download for free at http://cnx.org/contents/383d4b87-2d7b-454e-99fe-2eaa43eae8ff@20.20
The Lo¨wenheim-Skolem theorem of logic states that if a set of (countable) domain axioms has a model at all, then it has a countable model. This is a bit surprising when applied to the axioms of arithmetic for the real numbers: even though the real numbers are uncountable, there is some countable model which meets all our (fnite) axioms of the real numbersl
- 1297 reads
