Statement:
Löwenheim-Skolem Theorem: If a countable family of first order sentences is satisfiable in a set \(M\) then it is satisfiable in a countable subset of \(M\). (See Moore, G. [1982], p. 251 for references.
Howard_Rubin_Number: 42
Parameter(s): This form does not depend on parameters
This form's transferability is: Unknown
This form's negation transferability is: Negation Transferable
Article Citations:
Book references
Zermelo's Axiom of Choice, Moore, G.H., 1982
Note connections: