Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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