Tarski3,052407

# Ie we have a consistency proof for mathematics zfc

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: on. I.e., we have a consistency proof for mathematics (ZFC) relative to that of T. 3 Furthermore, relative consistency proofs arising this way are generally very finitary. AMBITION: Newton/Leibniz calculus: Science and engineering. = Concept Calculus: Everything else. 3. BETTER THAN, MUCH BETTER THAN. We begin with the notions: better than (>), and much better than (>>). These are binary relations. The passage of > to >> is an example of what we call concept amplification. One can also view > and >> mereologically, as x > y iff y is a “proper part of x”. x >> y iff y is a “small proper part of x”. Define z is minimal if and only if ÿ(\$w)(z > w). Define z is minimally > y ´ ("w)(z > w ´ (y > w ⁄ y = w)). The nonlogical axioms of T(>,>>,=) BASIC. ÿx > x, x > y Ÿ y > z Æ x > z, x >> y Æ x > y. x >> y Ÿ y > z Æ x >> z. x > y Ÿ y >> z Æ x >> z. (\$x)(x >> y,z). x >> y Æ (\$z)(x >> z Ÿ z is minimally > y). MINIMAL (Political Axiom). There is nothing that is better than all minimal things. EXISTENCE (Exact Bound, Plenitude). Let x be a thing better than a given range of things. There is something that is better than the given range of things and the things that they are better than, and nothing else. Here we use L(>,>>,=) to present the range of things. Existence is like fusion. Here the “range of things” is given by a first order formula in L(>,>>,=) with parameters allowed. 4 AMPLIFICATION (Special Indiscernibility). Let y > given, as well as a true statement about x, using binary relations >,= and the unary relation >> x. corresponding statement about x, using >,= and >> also true. x be the The y, is THEOREM 3.1. Basic + Minimal + Existence + Amplification is mutually interpretable with ZFC. This is provable in EFA. AMPLIFIED LIMIT (Star). There is something that is better than something, and also much better than everything it is better than. BINARY AMPLIFICATION. Let y > x be given, as well as a true statement about x, using the binary relations >,= and the binary relation z >> w >> x. The corresponding statement about x, using >,= and z >> w >> y, is also true. Leads to much higher places in Interpretation Hierarchy than ZFC: THEOREM 3.2. Basic + Minimal + Existence + Amplification + Amplified Limit interprets ZFC + “there is an almost ineffable cardinal” and is interpretable in ZFC + “there exists an ineffable cardinal”. THEOREM 3.3. Basic + Minimal + Existence + Binary Amplification interprets ZFC + “there exists a Ramsey cardinal” and is interpretable in ZFC + “there exists a measurable cardinal”. THEOREM 3.4. Basic + Minimal + Existence + Binary Amplification + Amplified Limit interprets ZFC + “there exists a measurable cardinal with arbitrarily large lesser measurable cardinals” and is interpretable in ZFC + “there exists a measurabl...
View Full Document

## This note was uploaded on 08/05/2011 for the course MATH 366 taught by Professor Joshua during the Fall '08 term at Ohio State.

Ask a homework question - tutors are online
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://www.coursehero.com/file/6354011/Ie-we-have-a-consistency-proof-for-mathematics-ZFC-relative/", "fetch_time": 1498560886000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2017-26/segments/1498128321309.25/warc/CC-MAIN-20170627101436-20170627121436-00687.warc.gz", "warc_record_offset": 872456994, "warc_record_length": 24165, "token_count": 862, "char_count": 3222, "score": 3.78125, "int_score": 4, "crawl": "CC-MAIN-2017-26", "snapshot_type": "latest", "language": "en", "language_score": 0.885417640209198, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00057-of-00064.parquet"}