# An introduction to mathematical logic

Set theory and paradoxes[ edit ] Ernst Zermelo gave a proof that every set could be well-ordered, a result Georg Cantor had been unable to obtain. Here, the fundamental logical principle involved is that if a given affirmative statement is true, the negation of that statement is false, and if a given affirmative statement is false, the negation of that statement is true.

These results helped establish first-order logic as the dominant logic used by mathematicians. References and Further Reading An introduction to mathematical logic. Its syntax involves only finite expressions as well-formed formulas, while its semantics are characterized by the limitation of all quantifiers to a fixed domain of discourse.

The notion of a "truth table" is often utilized in the discussion An introduction to mathematical logic truth-functional connectives discussed below. Around the same time Richard Dedekind showed that the natural numbers are uniquely characterized by their induction properties.

Propositional logic largely involves studying logical connectives such as the words "and" and "or" and the rules determining the truth-values of the propositions they are used to join, as well as what these rules mean for the validity of arguments, and such logical relationships between statements as being consistent or inconsistent with one another, as well as logical properties of propositions, such as being tautologically true, being contingent, and being self-contradictory.

For example, the first two rules correspond to the rules of modus ponens and modus tollens, respectively. It seems to have been at least implicit in the work of Peirce, W. More serious attempts to study statement operators such as "and", "or" and "if It shows that if a particular sentence is true in every model that satisfies a particular set of axioms, then there must be a finite deduction of the sentence from the axioms.

It shows that if a particular sentence is true in every model that satisfies a particular set of axioms, then there must be a finite deduction of the sentence from the axioms. Inhe published a new proof of the uncountability of the real numbers that introduced the diagonal argumentand used this method to prove Cantor's theorem that no set can have the same cardinality as its powerset.

Frege was also the first to systematically argue that all truth-functional connectives could be defined in terms of negation and the material conditional.

Necessarily, someone is reading an article in a philosophy encyclopedia. Truth-functional propositional logic is that branch of propositional logic that limits itself to the study of truth-functional operators. Everyone born on Monday has purple hair. Fitch and Irving Copi In this usage, the English sentence, "It is raining", and the French sentence "Il pleut", would be considered to express the same proposition; similarly, the two English sentences, "Callisto orbits Jupiter" and "Jupiter is orbitted by Callisto" would also be considered to express the same proposition. Beginning ina group of prominent mathematicians collaborated under the pseudonym Nicolas Bourbaki to publish a series of encyclopedic mathematics texts. Here, the fundamental logical principle involved is that if a given affirmative statement is true, the negation of that statement is false, and if a given affirmative statement is false, the negation of that statement is true.

We shall consider these individually. Much of their work involved producing better formalizations of the principles of Aristotle or Chrysippus, introducing improved terminology and furthering the discussion of the relationships between operators.

The 19th century saw great advances in the theory of real analysisincluding theories of convergence of functions and Fourier series. The term proposition is sometimes used synonymously with statement. The recognition that the above argument is valid requires one to recognize that the subject in the first premise is the same as the subject in the second premise. Introduction to Mathematical Thinking from Stanford University. Learn how to think the way mathematicians do – a powerful cognitive process developed over thousands of years. Mathematical thinking is not the same as doing mathematics – at least. mathematical logic. [n the belief that beginners should be exposed to the easiest and most natural proofs, I have used free-swinging set-theoretic methods. The significance of a demand for constructive proofs can be evaluated only after a certain amount of experience with mathematical logic has been obtained.

The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability.

Buy A Mathematical Introduction to Logic on michaelferrisjr.com FREE SHIPPING on qualified orders. Propositional Logic. Propositional logic, also known as sentential logic and statement logic, is the branch of logic that studies ways of joining and/or modifying entire propositions, statements or sentences to form more complicated propositions, statements or sentences, as well as the logical relationships and properties that are derived from these methods of combining or altering statements.

A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students.

An introduction to mathematical logic
Rated 5/5 based on 83 review
List of mathematical logic topics - Wikipedia