-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathproofs.xml
More file actions
37 lines (23 loc) · 2.84 KB
/
proofs.xml
File metadata and controls
37 lines (23 loc) · 2.84 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
<?xml version="1.0" encoding="UTF-8" ?>
<!-- This file is part of the book -->
<!-- -->
<!-- Logic and Proof for Teachers -->
<!-- -->
<!-- Copyright (C) 2019 Lesa L. Beverly, Kimberly M. Childs, Deborah A. Pace, Thomas W. Judson -->
<!-- -->
<!-- See the file COPYING for copying conditions. -->
<chapter xml:id="proofs" xmlns:xi="http://www.w3.org/2001/XInclude">
<title>Proofs</title>
<introduction>
<p>As we stated both in the preface as well as earlier in this chapter, our working definition of mathematics is that it is the application of inductive and deductive logic to a system of axioms. It is not our purpose in this text to formalize the logical procedure required to provide formalistic proofs. Rather, we wish to arm the student with the basic logic and methods of attack used to form convincing arguments of the validity of the statements encountered in a reasonably careful study of the foundations of mathematics.</p>
<p>Since we will need a working definition of the word <q>proof,</q> we agree that a proof is a logical sequence of steps which validate the truth of the proposition in question. In this vein the reader should review those statements which we have <a>proven</a> and note that usually we merely showed that certain definitions were satisfied. For example, when we proposed certain statements were equivalent, we established that they had the same truth value. Surely, as we proceed further, we will be forced to provide proofs which require longer and at times more subtle sequences of logical statements. Our endeavor, as well as yours, will be to convince the reader of the truth of the propositions in question.</p>
<p>There are, however, some general approaches to proofs which are based on the various tautologies and contradictions presented in <xref ref="logic-section-tautologies" />. Most theorems are merely conditional statements of the form, <q>If <m>p</m>, then <m>q</m>.</q> Certainly, <m>p</m> and <m>q</m> might themselves be complicated compound statements, but that should not be allowed to cloud the issue at this time, so let us consider a typical theorem and a few general types of proof.</p>
</introduction>
<section xml:id="proofs-section-direct-proofs">
<title>Direct Proofs</title>
</section>
<section xml:id="proofs-section-indirect-proofs">
<title>Indirect Proofs</title>
<p>dkfjdfjkj</p>
</section>
</chapter>