Foundations of Mathematics
|
|
- Barry Nelson
- 6 years ago
- Views:
Transcription
1 Foundations of Mathematics Andrew Monnot 1 Construction of the Language Loop We must yield to a cyclic approach in the foundations of mathematics. In this respect we begin with some assumptions of language and a minimal set of axioms within that language and use the results to establish the existence of algebraic objects with which another language can be constructed. What separates this approach from that of circular reasoning is that the secondary language created is sort of bounded above by the initial metalanguage. One simply starts at an abritrary level of abstraction and creates lower levels by travelling forwards in the meta loop. meta loop mathematics 1. There exists a set called a language, belonging to which is a set of letters, a set of terms, and a set of grammar/morphological operations. That this paper has any meaning could itself be construed as a special case of this axiom. For convenience we use that special case: the existence of the English language, in which case the above axiom is well-defined. We now adopt set theoretic notation to simplify the English sentences, including the operations,, :=, and quantifier on propositions together with: x y := ( x y) xφ(x) := x φ(x) x y := x y x y := (x y) (y x). Note that for the quantifiers and, one must specify a domain of discourse. That is, the basic formulas involving quantifiers are ( x X)(φ(x)) or ( x X)(φ(x)). 2. ( of Pairing) x y z w(w z w = x w = y). By this axiom, if we have two sets x and y, we can define their pair set {x, y}. We can thus define a singleton of x as {x} := {x, x} and set {x} = {x, x}. Moreover we can define the notion of an ordered pair: (x, y) := {{x}, {x, y}} and inductively by (x 1,..., x n ) := ((x 1,..., x n 1 ), x n ). 3. (Schema of Separation) x a y b φ(b, a)(b y b x φ(b, a)). 1
2 This allows us to define subsets of some set whose elements b satisfy a condition φ(b, a). In particular we have the intersection and difference of two sets, as well as the empty set: x y = {a x : a y} x y = {a x : a / y} = {x : x x}. We say sets x and y are disjoint if x y =. 4. ( of Union) x y a(a y b(b x a b)). This yields the existence of a union set over a family of sets: X = {a x : x X}. We can now define and x y = {x, y} x y = (x y) (y x). 5. ( of Power Set) x y a(a y a x). The set y above is called the power set of x, which can be formally written as P (x) = {y : y x}. We are now in a position to define an important set. Definition as 1.1. Let X and Y be sets. We define the cartesian product of X and Y X Y = {(x, y) : x X and y Y }. Note that the cartesian product is a set since X Y P (P (X Y )). A relation between X and Y is a subset R X Y. An n-ary relation on a set X is a subset of X n = n 1X. A relational structure is a set X together win an n-ary relation. Definition 1.2. A function from X to Y is a relation f between X and Y such that (i) ( x X)( y Y )((x, y) f) (right-extendable) (ii) ( (x, y) f)( (x, z) f)(y = z) (functional). We may write f : X Y. If (x, y) f, we may write y = f(x). We further define domain, range, and preimage: dom f = {x X : ( y Y )(y = f(x))} ran f = {y Y : ( x X)(y = f(x))} f 1 (A) = {x X : f(x) A Y }. 2
3 Hence we have f 1 (ran f) = dom f. These are all sets since dom f, ran f, f 1 (A) f. We let Y X = {f : X Y } denote all functions from X to Y, which is also a set since Y X P (X Y ). A function f : X Y is surjective if ran f = Y. f is injective if ((x, y) f (z, y) f) x = z. An n-ary operation on X is a function f : X n X. A structure is a set together with an n-ary operation. The signature of a structure is a sequence σ(x) = (n 1,..., n k,...) where n k is the number of k-ary operations. Definition 1.3. Let X and Y be structures with the same signature such that each k-ary operation of X is assigned to a k-ary operation of Y (i.e. f(o i ) = O i where O i is the ith k-ary operation of X). A homomorphism between structures X and Y is a map ϕ : X Y such that ϕ(o i (x 1,..., x n )) = O i (ϕ(x 1 ),..., ϕ(x n )). Note that a nullary operation on X is a map O : X. That is, it is simply an element of X. Now let A be a set which we will call an alphabet, and its elements will be called letters. A monoid X has a nullary operation, 1 X called a space (or empty letter), and a binary operation, which will simply be denoted by concatenation. We define the free monoid on A as the monoid A consisting of all strings of elements in A. We now have two definitions of a language, of which the first is traditional and the second is mine: Definition 1.4. A language is a subset of A. Alt. Definition 1.4. Let W A, T be a relational structure (a set together with an n-ary relation), and F be a structure. The language L F,T,W is defined as F [T [W ]]/T [W ] where X[Y ] is the free X-structure on Y. In particular elements of W are called words, elements of T [W ] are called terms, and elements of L F,T,W are called formulas. The definition of the factorization depends on whether or not F has an identity. If so, we simply set the terms equal to an identity formula. Otherwise we can interpret the factorization as set subtraction. Definition 1.5. A theory of L F,T,W is a subset X L F,T,W. Elements of a theory are called axioms. Elements of F [X] are called propositions. A theory X of L F,T,W is called a reduced theory if for all φ, ψ X, ψ O(φ, x 1,..., x n 1 ) for all n-ary operations of F and all placements of φ in evaluation of the operation. (That is, the theory is reduced if no axiom is in the orbit of another). For example, the theory L F,T,W is called the trivial theory. The theory is called the empty (or agnostic) theory. Definition 1.6. An n-ary logic system on a theory X is a homomorphism ϕ : F [X] V where V has cardinality n and F and V have the same signature. We further say that the theory is normal if ϕ(φ) = ϕ(ψ) for all φ, ψ X. In traditional logic V is a two element boolean algebra. Traditional logic also has a special kind of function on its language. Definition 1.7. A quantifier on L F,T,W is a function : T [W ] L F,T,W L F,T,W. We may write: (x X, φ) = ( x X)φ. 3
4 In particular it is a pseudo operation, and gives the language a pseudo structure. This is similar to modules, where in this case a product of a term and a formula are sent to a formula. Hence our initial assumption of four axioms (as well as the ability to understand the English language), have in turn given us the ability to create a notion of a language of which a degenerate English can be construed as a special case. This is certainly circular in some sense, but in foundations we must appeal to some cyclic process. One subtlety worth noting is that the secondary language created will always be strictly bounded above by the initial language; they aren t truly equivalent. (In fact this last statement is similar to the antecedent of Godel s Second Incompleteness theorem). 2 Absorption of Mathematical Logic The next task is to absorb the traditional area of mathematical logic. One key missing ingredient is a model. Let us recall the traditional setup (taken from [1]). Definition 2.1. Let S be a set (of symbols). An S-structure is a pair A = (A, a) where A is a nonempty set, called a universe, and a is a map sending symbols to elements, functions, and relations of A. An assignment of an S-structure (A, a) is a map β : S A. An S-interpretation is a pair I = (A, β) where A is an S-structure and β is an assignment in A. For shorthand notation, the convention (with some of my modifications) is to write: c A = β(c), (f(t 1,..., t n )) A = a(f)(β(t 1 ),..., β(t n )), and (xry) A = β(x)a(r)β(y). These are the terms. Formulas are then built from the terms using traditional (although this can be generalized) logical connectives. The notion of a model is then defined via induction on formulas. Definition 2.2. Let I = (A, β) be an S-interpretation. We say that I satisfies a formula φ (or is a model of φ), denoted I φ, if φ A holds, where φ A is defined via its components and β and a where necessary. Formal languages in convention are built up from the formulas mentioned above, which are nothing more than special cases of Alt Definition 1.4. A model for a language is hence nothing more than an A-interpretation into a structure, where A is an alphabet (provided it is equipped with a logic system). This is precisely what I have constructed in section 1; the symbols of W A are mapped to the universe L F,T,W. The next thing to establish is that every model is a language model. This is trivial since a model by definition satisfies a set of formulas as well as compounds of them (i.e. it must satisfy a language). Hence we have no need to trouble ourselves with interpretations and may simply stick to the algebra of section 1. While we have absorbed model theory, there are a few more critical topics to absorb from mathematical logic. We return to the terminology of section 1. Let X be a theory of L F,T,W and ϕ : F [X] V be a binary logic system. A formula φ L F,T,W is derivable in X if it is a proposition (i.e. is in F [X]). We may write X φ. This definition is in complete agreement with the traditional definition (namely, there being a derivation, or finite number of steps, that begin with axioms and use inference rules); it is nothing more than saying it is in F [X]. Similarly φ L F,T,W is valid if φ, or equivalently, it is 4
5 derivable in any theory. In our setup this would imply φ F [ ] =. Hence no formula is valid. Let F have a unary operation and ϕ : F [X] V be a logic system on a theory X. If we assume to be idempotent ( φ = φ), then since ϕ is a homomorphism, we have ϕ(φ) = ϕ( φ) = ϕ(φ). That is, the corresponding unary operation in V must also be idempotent on ran(ϕ). Definition 2.3. A unary operation (not necessarily idempotent) is consistent in ϕ if for all φ F [X], ϕ(φ) ϕ( φ). If we assume is consistent in ϕ and that ϕ is a binary logic system, then the corresponding in V is idempotent since ϕ(φ) = 0 ϕ( φ) = 1 ϕ( φ) = ϕ(φ) = 0. Again, proofs in a binary system are independent of the choice of valence. If we assume consistency and idempotency, then we have a nonidentity negation which is idempotent on the range. The case for assuming binary system and idempotency yields either a trivial mapping of propositions (all to 0 or all to 1), or that is consistent and idempotent on V. And lastly if we assume all three (idempotency and consistency of together on a binary system), we obtain a surjective assignment with idempotent negation in V. Let ϕ : F [X] V be a binary logic system where V is a boolean algebra. Then the completeness and compactness theorems are trivial. Recall these statements: Completeness Theorem. For all formulas φ and models I, I φ X φ where I X. Compactness Theorem. For all formulas φ and models I, X φ I φ where I X. Traditionally these apply to, what we would call, a binary logic system ϕ : F [X] V where V is a boolean algebra (hence F has a consistent, idempotent negation) under traditional operations, and in particular this fixes the operational/relational structures of F, T, and W, but X is arbitrary. In this setup, all formulas (or what we would hence call propositions since they are generated by a theory) are trivially satisfiable since they have a language model. Hence Compactness is true. Moreover since they are propositions in a binary logic system, they are in some F [X] for a theory X and are hence derivable; so we have Completeness. Lastly we wish to address Godel s Second Incompleteness Theorem; recall its statement: Godel s Second Incompleteness Theorem. A theory contains a statement of its own consistency if and only if it is inconsistent. We have only defined what it means for a unary operation in a logical system to be consistent. Hence we can say that a binary logic system with a unary operation is consistent if its unary operation is consistent. But all of these traditional theorems of mathematical logic are assuming a binary logic system where V is a boolean algebra, is idempotent, and the map ϕ : F [X] V is surjective. Hence is consistent (from above 5
6 discussion), and the right-hand side of the theorem is false. The simplest example of the antecedent of Godel s theorem is to use a structure to create itself (i.e. a self-swallowing structure), which makes no sense, let alone using it to create a larger structure within which is a statement about the initial structure. That a binary logic system with unary operation contains a statement of its own consistency is itself a contradiction, since such a statement is in the complement of the logic system within the metalanguage. Hence the left-hand side is also false. So both implications are true. 3 Absorption of Category Theory Category theory can easily be interpreted as a language. The alphabet consists of all the symbols we need to represent categories, objects, morphisms, membership, products, coproducts, logical connectives for our statements...etc. The words in turn consist the concatenations we want. The relational structure is defined on our category and object words: we define a reflexive and transitive relation on {Cat} 2 and Ob(Cat) 2. This gives us the identity and composition rules for functors and morphisms. The formulas then consist of statements involving categories/objects. 6
7 References [1] Ebbinghaus, H.-D., J. Flum, and W. Thomas. Mathematical Logic. Second Edition. Undergraduate Texts in Mathematics. New York: Springer-Verlag
Equational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationLecture 2: Syntax. January 24, 2018
Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More information18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)
18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating
More informationACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)
ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted
More informationReview CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.
CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationTopos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.
logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationSyntactic Characterisations in Model Theory
Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries
More informationMeta-logic derivation rules
Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationBoolean Algebras, Boolean Rings and Stone s Representation Theorem
Boolean Algebras, Boolean Rings and Stone s Representation Theorem Hongtaek Jung December 27, 2017 Abstract This is a part of a supplementary note for a Logic and Set Theory course. The main goal is to
More informationLogic via Algebra. Sam Chong Tay. A Senior Exercise in Mathematics Kenyon College November 29, 2012
Logic via Algebra Sam Chong Tay A Senior Exercise in Mathematics Kenyon College November 29, 2012 Abstract The purpose of this paper is to gain insight to mathematical logic through an algebraic perspective.
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationChapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin
Chapter 0 Introduction Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin October 2014 Automata Theory 2 of 22 Automata theory deals
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationLecture 7. Logic. Section1: Statement Logic.
Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationMathematical Logic. An Introduction
Mathematical Logic. An Introduction Summer 2006 by Peter Koepke Table of contents Table of contents............................................... 1 1 Introduction.................................................
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationLecture 2: Connecting the Three Models
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 2: Connecting the Three Models David Mix Barrington and Alexis Maciel July 18, 2000
More informationMathematical Preliminaries. Sipser pages 1-28
Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationInquisitive semantics
Inquisitive semantics NASSLLI 2012 lecture notes Ivano Ciardelli University of Bordeaux Floris Roelofsen University of Amsterdam June 25, 2012 Jeroen Groenendijk University of Amsterdam About this document
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationQualifying Exam Logic August 2005
Instructions: Qualifying Exam Logic August 2005 If you signed up for Computability Theory, do two E and two C problems. If you signed up for Model Theory, do two E and two M problems. If you signed up
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More information4. Sets The language of sets. Describing a Set. c Oksana Shatalov, Fall
c Oksana Shatalov, Fall 2017 1 4. Sets 4.1. The language of sets Set Terminology and Notation Set is a well-defined collection of objects. Elements are objects or members of the set. Describing a Set Roster
More informationHandbook of Logic and Proof Techniques for Computer Science
Steven G. Krantz Handbook of Logic and Proof Techniques for Computer Science With 16 Figures BIRKHAUSER SPRINGER BOSTON * NEW YORK Preface xvii 1 Notation and First-Order Logic 1 1.1 The Use of Connectives
More informationSubtractive Logic. To appear in Theoretical Computer Science. Tristan Crolard May 3, 1999
Subtractive Logic To appear in Theoretical Computer Science Tristan Crolard crolard@ufr-info-p7.jussieu.fr May 3, 1999 Abstract This paper is the first part of a work whose purpose is to investigate duality
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More information2.2 Lowenheim-Skolem-Tarski theorems
Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationCHAPTER 2. FIRST ORDER LOGIC
CHAPTER 2. FIRST ORDER LOGIC 1. Introduction First order logic is a much richer system than sentential logic. Its interpretations include the usual structures of mathematics, and its sentences enable us
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
More informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationA generalization of modal definability
A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationHomework 5. Solutions
Homework 5. Solutions 1. Let (X,T) be a topological space and let A,B be subsets of X. Show that the closure of their union is given by A B = A B. Since A B is a closed set that contains A B and A B is
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationCopyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction
Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis
More informationWhat are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos
What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationChapter 1. Logic and Proof
Chapter 1. Logic and Proof 1.1 Remark: A little over 100 years ago, it was found that some mathematical proofs contained paradoxes, and these paradoxes could be used to prove statements that were known
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationTRUTH-THEORIES FOR FRAGMENTS OF PA
TRUTH-THEORIES FOR FRAGMENTS OF PA RICHARD G. HECK, JR. The discussion here follows Petr Hájek and Pavel Pudlák, Metamathematics of First-order Arithmetic (Berlin: Springer-Verlag, 1993). See especially
More informationSets, Logic, Relations, and Functions
Sets, Logic, Relations, and Functions Andrew Kay September 28, 2014 Abstract This is an introductory text, not a comprehensive study; these notes contain mainly definitions, basic results, and examples.
More informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationCategory Theory. Categories. Definition.
Category Theory Category theory is a general mathematical theory of structures, systems of structures and relationships between systems of structures. It provides a unifying and economic mathematical modeling
More informationCHEVALLEY S THEOREM AND COMPLETE VARIETIES
CHEVALLEY S THEOREM AND COMPLETE VARIETIES BRIAN OSSERMAN In this note, we introduce the concept which plays the role of compactness for varieties completeness. We prove that completeness can be characterized
More informationVictoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY
Gödel s Proof Victoria Gitman and Thomas Johnstone New York City College of Technology, CUNY vgitman@nylogic.org http://websupport1.citytech.cuny.edu/faculty/vgitman tjohnstone@citytech.cuny.edu March
More informationIntroduction to Automata
Introduction to Automata Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjin@postech.ac.kr 1 /
More informationBASIC MATHEMATICAL TECHNIQUES
CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationNotes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )
Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January 23 30 2017) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the
More informationMathematical Foundations of Logic and Functional Programming
Mathematical Foundations of Logic and Functional Programming lecture notes The aim of the course is to grasp the mathematical definition of the meaning (or, as we say, the semantics) of programs in two
More informationThe non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω
1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the
More informationLINDSTRÖM S THEOREM SALMAN SIDDIQI
LINDSTRÖM S THEOREM SALMAN SIDDIQI Abstract. This paper attempts to serve as an introduction to abstract model theory. We introduce the notion of abstract logics, explore first-order logic as an instance
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More information9/19/2018. Cartesian Product. Cartesian Product. Partitions
Cartesian Product The ordered n-tuple (a 1, a 2, a 3,, a n ) is an ordered collection of objects. Two ordered n-tuples (a 1, a 2, a 3,, a n ) and (b 1, b 2, b 3,, b n ) are equal if and only if they contain
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationAnalysis 1. Lecture Notes 2013/2014. The original version of these Notes was written by. Vitali Liskevich
Analysis 1 Lecture Notes 2013/2014 The original version of these Notes was written by Vitali Liskevich followed by minor adjustments by many Successors, and presently taught by Misha Rudnev University
More informationCHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)
CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring
More informationToday s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions
Today s Topics Set identities Methods of proof Relationships to logical equivalences Functions Important definitions Relationships to sets, relations Special functions Set identities help us manipulate
More informationSets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University
Sets, Models and Proofs I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University 2000; revised, 2006 Contents 1 Sets 1 1.1 Cardinal Numbers........................ 2 1.1.1 The Continuum
More informationTopics in Logic, Set Theory and Computability
Topics in Logic, Set Theory and Computability Homework Set #3 Due Friday 4/6 at 3pm (by email or in person at 08-3234) Exercises from Handouts 7-C-2 7-E-6 7-E-7(a) 8-A-4 8-A-9(a) 8-B-2 8-C-2(a,b,c) 8-D-4(a)
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationThree Profound Theorems about Mathematical Logic
Power & Limits of Logic Three Profound Theorems about Mathematical Logic Gödel's Completeness Theorem Thm 1, good news: only need to know* a few axioms & rules, to prove all validities. *Theoretically
More information3. Abstract Boolean Algebras
3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More information1 Differentiable manifolds and smooth maps
1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More informationThis is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability
16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of
More information2010 SUMMER COURSE ON MODEL THEORY: CHAPTER 1
2010 SUMMER COURSE ON MODEL THEORY: CHAPTER 1 PETE L. CLARK Contents Introduction 1 0.1. Some theorems in mathematics with snappy model-theoretic proofs 1 1. Languages, structures, sentences and theories
More informationChapter 2 Axiomatic Set Theory
Chapter 2 Axiomatic Set Theory Ernst Zermelo (1871 1953) was the first to find an axiomatization of set theory, and it was later expanded by Abraham Fraenkel (1891 1965). 2.1 Zermelo Fraenkel Set Theory
More informationToday s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets
Today s topics Introduction to Set Theory ( 1.6) Sets Definitions Operations Proving Set Identities Reading: Sections 1.6-1.7 Upcoming Functions A set is a new type of structure, representing an unordered
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationLecture 12. Statement Logic as a word algebra on the set of atomic statements. Lindenbaum algebra.
V. Borschev and B. Partee, October 26, 2006 p. 1 Lecture 12. Statement Logic as a word algebra on the set of atomic statements. Lindenbaum algebra. 0. Preliminary notes...1 1. Freedom for algebras. Word
More information