LOGIC AND THE METHODOLOGY OF SCIENCE PRELIMINARY EXAMINATION 1. Prove or disprove: For any uncountable well-ordered set (X, <) there is a countable well-ordered set (Y, <) for which (X, <) ≡ (Y, <). 2. Suppose that L i - First uncountable ordinal - Document - PDFSEARCH.IO

First Page	Meta Content
	LOGIC AND THE METHODOLOGY OF SCIENCE PRELIMINARY EXAMINATION 1. Prove or disprove: For any uncountable well-ordered set (X, <) there is a countable well-ordered set (Y, <) for which (X, <) ≡ (Y, <). 2. Suppose that L i Add to Reading List Document Date: 2014-08-24 16:43:20 Open Document File Size: 60,85 KB Share Result on Facebook SocialTag Model theory Functions and mappings Ordinal numbers Logic in computer science Peano axioms Constructible universe First-order logic Function Well-order Mathematical logic

LOGIC AND THE METHODOLOGY OF SCIENCE PRELIMINARY EXAMINATION 1. Prove or disprove: For any uncountable well-ordered set (X, <) there is a countable well-ordered set (Y, <) for which (X, <) ≡ (Y, <). 2. Suppose that L iAdd to Reading List