What is Mathematics? Part 1

Mathematics originates from the Greek word 'mathema,' meaning knowledge. It lacks a universally accepted definition but is viewed by many, including Galileo and Hilbert, as a key to understanding the universe and a rigorous conceptual system. This lesson specifically explores mathematics as a universal language, shared across cultures, with its own vocabulary, conventions, and sentence structures, much like English.

Mathematical language allows for the formation of sentences. Declarative sentences, such as '3 + 7 = 22,' can be true or false. A proposition is a declarative sentence that is definitively true or false. The negation of a proposition flips its truth value. Propositional variables (p, q, r, etc.) are used to represent propositions, and these can be combined using logical connectives.

Propositional variables are combined using binary propositional connectives: conjunction ('and'), disjunction ('or'), exclusive or ('xor'), implication ('if then'), and biconditional ('if and only if'). These form compound propositions. The truth values of compound propositions are determined by the truth values of their constituent simple propositions according to specific rules for each connective. Bit strings can also be combined bitwise.

For two propositional variables, there are four possible truth value combinations. The video details the truth tables for conjunction, disjunction, exclusive or, implication, and biconditional. Key points include: conjunction is true only if both propositions are true; disjunction is false only if both are false; exclusive or is true if propositions have different truth values; implication is false only if the hypothesis is true and the conclusion is false; biconditional is true if both propositions have the same truth value.

Compound propositions can be classified as tautologies (always true), contradictions (always false), or contingencies (neither). A logical equivalence is a biconditional that is a tautology, meaning two propositions always have the same truth value. Truth tables are used to demonstrate these classifications and verify logical equivalences, such as De Morgan's laws.

For an implication 'p implies q' (p is the hypothesis, q is the conclusion), its converse is 'q implies p,' its inverse is 'not p implies not q,' and its contrapositive is 'not q implies not p.' While an implication, its converse, and its inverse do not necessarily mean the same thing, an implication is logically equivalent to its contrapositive. Examples illustrate these concepts.

Propositional functions, or predicates, are statements about variables. Substituting a specific value for the variable determines the truth value of the statement. Quantification transforms a propositional function into a statement with a definite truth value. Universal quantification ('for all x') means the statement is true for every possible value of x. Existential quantification ('there exists an x') means the statement is true for at least one value of x. Negations of quantified statements are also discussed with examples.