Lecture Notes: Discrete Mathematics
|
|
- Ralf Beasley
- 7 years ago
- Views:
Transcription
1 Lecture Notes: Discrete Mathematics GMU Math Sring 2007 Alexei V Samsonovich Any theoretical consideration, no matter how fundamental it is, inevitably relies on key rimary notions that are acceted without definition. In our case, examles of notions that we shall accet without definitions are: an object, a value, a concet, a symbol, to name just a few. In fact, most English words used here are not defined yet exected to be understood. Given this agreement, our first ste is to give useful definitions of the key terms, notations and concets wisely selected among others. Below in this text, whenever a key term is introduced, it is tyed in bold italic. Synonyms are listed in arentheses. An examle follows immediately. Discrete mathematics (sometimes understood as finite mathematics) is the study of mathematical structures that do not suort or reuire the notion of continuity. In articular, all comuter imlementations of continuous mathematical structures involve their finite discretization in a certain sense. Toics of discrete mathematics include logic, sets, number theory, combinatorics, grahs, algorithms, robability, information, comlexity, comutability, and more. Lecture notes included here should be considered comlementary rather than alternative to the textbook. The intent is to hel with understanding of difficult concets: sometimes by taking the reader to a higher level of abstraction that oens a better view of the main subject, and sometimes by sueezing the essence from long ages into just a few lines. Lecture 1: Logic It is generally understood that mathematics lays the role of a theoretical fundament for all modern natural sciences. In the same sense, logic can be viewed as a theoretical fundament for mathematics in general and for discrete mathematics in articular. It is not surrising therefore that we start our consideration with logic. In order to introduce concets of logic from first rinciles, we need to introduce some other general notions first. By introduce I do not mean rigorously define. Many of these notions will be addressed in more detail and used extensively in subseuent lectures, so in a sense the following three aragrahs are just an outline. A set is a collection of distinct objects called elements (or members) of the set. In articular, the notion of a set does not allow for multile instances (reetitions) of the same element in the set. In contrast, a seuence is an ordered collection that allows for reetition of its elements. An ordered n-tule is a seuence of n elements. If X is a set, then X n (the n-th ower of X) is the set of all ordered n-tules over X ( over X here means comosed from elements of X). An n-lace relation on X is a subset of X n.
2 Sulementary Lecture Notes for Math Alexei V. Samsonovich 1/27/ An exression is a finite seuence of elements-symbols (the entire set of symbols of a given language is called alhabet or vocabulary). A well-formed exression satisfies certain grammar rules (that need to be secified searately in each articular case of a formal theory). Below the term exression will refer to well-formed exressions only. A language is a set of exressions over an alhabet. A formal axiomatic theory is a language in which a subset of exressions are called axioms, and the rest are connected to the axioms via relations called inference rules. A seuence of these connections that starts from axioms is called a roof, and the exression at the end of this seuence is a theorem. A theory is decidable, if there is an algorithm to determine for any given exression whether it has a roof. Here we comare two theories: roositional calculus and redicate calculus (both are addressed in more detail below). Elements of roositional calculus are truth-valued (Boolean) variables, constants and exressions constructed from them using connectives (AND, OR, etc.). Elements of redicate calculus are variables that may take values of any nature (e.g., numbers, eole), lus arbitrary truth-valued functions of those variables called redicates, lus connectives and uantifiers used to construct exressions. A variable is a symbol that can be associated with (bound to) a value, an object, a set, or an exression. A variable can be free or bound. Variables may have tyes: restrictions on the nature of objects to which they can bind. On the other hand, a uantifier secifies a set of objects to which a variable is (to be) bound. While it is ossible to design an unlimited number of uantifiers, two of them are commonly used in most cases: the universal uantifier, secifying that something alies (the variable can be bound) to any element of a certain category, and the existential uantifier, secifying that something alies to at least one element. Given the above outline, we can define roositional calculus (roositional logic) as a formal axiomatic theory L with the alhabet, syntax, set of axioms and inference rules that follow below. The alhabet includes connectives (,,,, ), arentheses: (, ), and variables denoted here by lowercase English letters that may aear with or without subscrits. Each variable in L is bound to a roosition (a statement), which is an exression that is either true or false (i.e., has a definite truth value). The set of exressions in L can be formally given as follows. 1. All letters that denote statements with definite truth values are exressions of L. 2. If B and G are exressions of L, then so are ( B) and (B G). 3. If B, G and D are laceholders for exressions of L, then the following axiom schemas define axioms of L: a. (B (G B)) b. ((B (G D)) ((B G) (B D))) c. ((( G) ( B) ((( G) B) G)) 4. It suffices for L to have the only inference rule, modus onens: ((a b, a) b. Again, in summary, roositional calculus (roositional logic) can be defined as a formal axiomatic theory in which the alhabet includes variables denoted by letters (e.g.,
3 Sulementary Lecture Notes for Math Alexei V. Samsonovich 1/27/2007 3, 1 ), symbols 1 and 0 used for tautology and contradiction, connectives (,,,, ) and arentheses: (, ), the set of axioms includes those given by the above schemas (a), (b) and (c), and the only inference rule is modus onens. We can avoid using unnecessary arentheses, if we agree on a articular order of recedence for connectives, e.g.:,,,,, and then and other symbols of meta-language. We can reason about variables in L without knowing their values, yet we assume that they have definite values within the set {T, F}. This feature searates roositional calculus from redicate calculus, in which redicates may have free variables. In L, all exressions are roositions. A direct analogy with regular numerical exressions can be seen. Indeed, roositional logic is isomorhic to binary arithmetic (calculus of Boolean numbers: zeros and ones), as the following translation table shows. This translation rovides an intuition into L and can be taken as a art of its definition. Table 1. L is isomorhic to Boolean arithmetic. Proositional logic Boolean arithmetic T 1 F (XOR) (1-) 0 Given this table, you can confidently solve your HW1 roblems (or you can use the truth tables), yet there is a more convenient way of doing this: by using euivalence relations listed on age 24 in the textbook. At least, with this table you should have no roblem understanding what L is about: it is a calculus in which all variables and exressions take only two values. In this sense it is much simler than redicate calculus. Therefore, for examle, it is not surrising that and cannot be simultaneously false in roositional logic. It is also clear that there may be cases when P Q holds and P Q does not (generally, whenever P Q holds, P Q is a tautology, and vice versa). The analogy between and multilication, and addition with regard to commutativity, associativity and distributivity is straightforward. In articular, it imlies that euivalence relations allow us to reduce any logical exression to its disjunctive normal form (dns): i.e., a logical sum (disjunction) of disjuncts, each of which is either a logical roduct (conjunction) of literals (i.e., variable letters or their negations) or a single literal. The counterart of dns is a conjunctive normal form (cns) defined similarly, with swaing
4 Sulementary Lecture Notes for Math Alexei V. Samsonovich 1/27/ and. These forms can be useful when you want to comare two exressions. A dns / cns is called full, if each of its disjuncts / conjuncts is a minterm (contains each variable used in the form exactly once). Every non-contradiction / non-tautology can be reduced to a full dns / cns. An exression is satisfiable if it is true for some values of its variables. A logical argument is a finite set of roositions called remises or hyotheses followed by a roosition called conclusion. In a valid argument, the conclusion is true whenever remises are true. A sound argument is a valid argument in which remises are true. An arguments can be written in a column form (below), or as a comound statement with an imlication connecting remises to the conclusion. As a comound statement, a valid argument is a tautology. Moreover, its variables can be treated as laceholders for exressions (substitution theorem). All this is useful for roblem solving. A table of useful arguments some inference rules derived from modus onens is given below. Table 2. Inference rules. Modus onens Modus tollens introduction Contraositive Case analysis r r r Vacuous roof: introduction elimination introduction elimination Disjunctive syllogism Resolution r r Chain rule r r Contradiction F
5 Sulementary Lecture Notes for Math Alexei V. Samsonovich 1/27/ First-order logic (FOL, first-order redicate calculus) is an extension of roositional logic L that includes uantifiers, redicates (see above) and variables with arbitrary values beyond {T, F}, with the excetion for redicates themselves, which makes this theory first-order (without this restriction we run into logical aradoxes). The set of axioms and the set of rules of inference in FOL, as comared to L, is augmented with (intuitively obvious) axioms and arguments involving uantifiers. A higher-order logic differs from FOL in that its redicates are allowed to have redicates as their arguments. The notion of logic, esecially in comuter science, is raidly exanding in many dimensions, including fuzzy logic, many-valued logic, uantum logic, modal logics (temoral, dynamic, deontic, alethic, eistemic, etc.). Related calculi include situation calculus, fluent calculus, event calculus, etc. Further Reading: Hamburger, H., and Richards, D. (2002) Logic and Language Models for Comuter Science. Uer Saddle River, NJ: Prentice Hall. Mendelson, E. (1997) Initroduction to Mathematical Logic. New York: Chaman & Hall.
Introduction to NP-Completeness Written and copyright c by Jie Wang 1
91.502 Foundations of Comuter Science 1 Introduction to Written and coyright c by Jie Wang 1 We use time-bounded (deterministic and nondeterministic) Turing machines to study comutational comlexity of
More information6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks
6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In
More informationSoftware Model Checking: Theory and Practice
Software Model Checking: Theory and Practice Lecture: Secification Checking - Temoral Logic Coyright 2004, Matt Dwyer, John Hatcliff, and Robby. The syllabus and all lectures for this course are coyrighted
More informationLikewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationSQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID
International Journal of Comuter Science & Information Technology (IJCSIT) Vol 6, No 4, August 014 SQUARE GRID POINTS COVERAGED BY CONNECTED SOURCES WITH COVERAGE RADIUS OF ONE ON A TWO-DIMENSIONAL GRID
More informationA Modified Measure of Covert Network Performance
A Modified Measure of Covert Network Performance LYNNE L DOTY Marist College Deartment of Mathematics Poughkeesie, NY UNITED STATES lynnedoty@maristedu Abstract: In a covert network the need for secrecy
More informationdef: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More informationPrecalculus Prerequisites a.k.a. Chapter 0. August 16, 2013
Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, Ph.D. Lakeland Community College Jeff Zeager, Ph.D. Lorain County Community College August 6, 0 Table of Contents 0 Prerequisites 0. Basic Set
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationPoint Location. Preprocess a planar, polygonal subdivision for point location queries. p = (18, 11)
Point Location Prerocess a lanar, olygonal subdivision for oint location ueries. = (18, 11) Inut is a subdivision S of comlexity n, say, number of edges. uild a data structure on S so that for a uery oint
More information1 Gambler s Ruin Problem
Coyright c 2009 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationLogic in Computer Science: Logic Gates
Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers
More informationThe Magnus-Derek Game
The Magnus-Derek Game Z. Nedev S. Muthukrishnan Abstract We introduce a new combinatorial game between two layers: Magnus and Derek. Initially, a token is laced at osition 0 on a round table with n ositions.
More informationStochastic Derivation of an Integral Equation for Probability Generating Functions
Journal of Informatics and Mathematical Sciences Volume 5 (2013), Number 3,. 157 163 RGN Publications htt://www.rgnublications.com Stochastic Derivation of an Integral Equation for Probability Generating
More informationThe impact of metadata implementation on webpage visibility in search engine results (Part II) q
Information Processing and Management 41 (2005) 691 715 www.elsevier.com/locate/inforoman The imact of metadata imlementation on webage visibility in search engine results (Part II) q Jin Zhang *, Alexandra
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More informationConcurrent Program Synthesis Based on Supervisory Control
010 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 30-July 0, 010 ThB07.5 Concurrent Program Synthesis Based on Suervisory Control Marian V. Iordache and Panos J. Antsaklis Abstract
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationPRIME NUMBERS AND THE RIEMANN HYPOTHESIS
PRIME NUMBERS AND THE RIEMANN HYPOTHESIS CARL ERICKSON This minicourse has two main goals. The first is to carefully define the Riemann zeta function and exlain how it is connected with the rime numbers.
More informationRisk in Revenue Management and Dynamic Pricing
OPERATIONS RESEARCH Vol. 56, No. 2, March Aril 2008,. 326 343 issn 0030-364X eissn 1526-5463 08 5602 0326 informs doi 10.1287/ore.1070.0438 2008 INFORMS Risk in Revenue Management and Dynamic Pricing Yuri
More informationComputational Logic and Cognitive Science: An Overview
Computational Logic and Cognitive Science: An Overview Session 1: Logical Foundations Technical University of Dresden 25th of August, 2008 University of Osnabrück Who we are Helmar Gust Interests: Analogical
More informationMultiperiod Portfolio Optimization with General Transaction Costs
Multieriod Portfolio Otimization with General Transaction Costs Victor DeMiguel Deartment of Management Science and Oerations, London Business School, London NW1 4SA, UK, avmiguel@london.edu Xiaoling Mei
More informationFailure Behavior Analysis for Reliable Distributed Embedded Systems
Failure Behavior Analysis for Reliable Distributed Embedded Systems Mario Tra, Bernd Schürmann, Torsten Tetteroo {tra schuerma tetteroo}@informatik.uni-kl.de Deartment of Comuter Science, University of
More informationThe Online Freeze-tag Problem
The Online Freeze-tag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE-3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,
More informationPOISSON PROCESSES. Chapter 2. 2.1 Introduction. 2.1.1 Arrival processes
Chater 2 POISSON PROCESSES 2.1 Introduction A Poisson rocess is a simle and widely used stochastic rocess for modeling the times at which arrivals enter a system. It is in many ways the continuous-time
More informationAs we have seen, there is a close connection between Legendre symbols of the form
Gauss Sums As we have seen, there is a close connection between Legendre symbols of the form 3 and cube roots of unity. Secifically, if is a rimitive cube root of unity, then 2 ± i 3 and hence 2 2 3 In
More informationNP-Completeness and Cook s Theorem
NP-Completeness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:
More informationA Simple Model of Pricing, Markups and Market. Power Under Demand Fluctuations
A Simle Model of Pricing, Markus and Market Power Under Demand Fluctuations Stanley S. Reynolds Deartment of Economics; University of Arizona; Tucson, AZ 85721 Bart J. Wilson Economic Science Laboratory;
More informationFrequentist vs. Bayesian Statistics
Bayes Theorem Frequentist vs. Bayesian Statistics Common situation in science: We have some data and we want to know the true hysical law describing it. We want to come u with a model that fits the data.
More informationMore Properties of Limits: Order of Operations
math 30 day 5: calculating its 6 More Proerties of Limits: Order of Oerations THEOREM 45 (Order of Oerations, Continued) Assume that!a f () L and that m and n are ositive integers Then 5 (Power)!a [ f
More informationComputational Finance The Martingale Measure and Pricing of Derivatives
1 The Martingale Measure 1 Comutational Finance The Martingale Measure and Pricing of Derivatives 1 The Martingale Measure The Martingale measure or the Risk Neutral robabilities are a fundamental concet
More informationALGEBRAIC SIGNATURES FOR SCALABLE WEB DATA INTEGRATION FOR ELECTRONIC COMMERCE TRANSACTIONS
ALGEBRAIC SIGNATURES FOR SCALABLE WEB DATA INTEGRATION FOR ELECTRONIC COMMERCE TRANSACTIONS Chima Adiele Deartment of Comuter Science University of Manitoba adiele@cs.umanitoba.ca Sylvanus A. Ehikioya
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationPartial-Order Planning Algorithms todomainfeatures. Information Sciences Institute University ofwaterloo
Relating the Performance of Partial-Order Planning Algorithms todomainfeatures Craig A. Knoblock Qiang Yang Information Sciences Institute University ofwaterloo University of Southern California Comuter
More informationStatic and Dynamic Properties of Small-world Connection Topologies Based on Transit-stub Networks
Static and Dynamic Proerties of Small-world Connection Toologies Based on Transit-stub Networks Carlos Aguirre Fernando Corbacho Ramón Huerta Comuter Engineering Deartment, Universidad Autónoma de Madrid,
More informationCUBIC AND QUARTIC FORMULAS. James T. Smith San Francisco State University
CUBIC AND QUARTIC FORMULAS James T. Smith San Francisco State University Quadratic formula You ve met the uadratic formula in algebra courses: the solution of the uadratic euation ax + bx + c = 0 with
More informationENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS
ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS Liviu Grigore Comuter Science Deartment University of Illinois at Chicago Chicago, IL, 60607 lgrigore@cs.uic.edu Ugo Buy Comuter Science
More informationComparing Dissimilarity Measures for Symbolic Data Analysis
Comaring Dissimilarity Measures for Symbolic Data Analysis Donato MALERBA, Floriana ESPOSITO, Vincenzo GIOVIALE and Valentina TAMMA Diartimento di Informatica, University of Bari Via Orabona 4 76 Bari,
More informationOverview of Lecture 3. Model Checking with SPIN. First attempt (revisited) Linear Temporal Logic (LTL) CDP #3
Concurrent and Distributed Programming htt://fmt.cs.utwente.nl/courses/cd/ Mel Checking with SPIN CDP #3 Overview of Lecture 3 Ch. 4 - Verification of Concurrent Programs linear temoral logic (LTL) deductive
More informationLogic Appendix. Section 1 Truth Tables CONJUNCTION EXAMPLE 1
Logic Appendix T F F T Section 1 Truth Tables Recall that a statement is a group of words or symbols that can be classified collectively as true or false. The claim 5 7 12 is a true statement, whereas
More informationRemarks on Non-Fregean Logic
STUDIES IN LOGIC, GRAMMAR AND RHETORIC 10 (23) 2007 Remarks on Non-Fregean Logic Mieczys law Omy la Institute of Philosophy University of Warsaw Poland m.omyla@uw.edu.pl 1 Introduction In 1966 famous Polish
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More information(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,
More informationCS 3719 (Theory of Computation and Algorithms) Lecture 4
CS 3719 (Theory of Computation and Algorithms) Lecture 4 Antonina Kolokolova January 18, 2012 1 Undecidable languages 1.1 Church-Turing thesis Let s recap how it all started. In 1990, Hilbert stated a
More informationA Little Set Theory (Never Hurt Anybody)
A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra
More informationTHE WELFARE IMPLICATIONS OF COSTLY MONITORING IN THE CREDIT MARKET: A NOTE
The Economic Journal, 110 (Aril ), 576±580.. Published by Blackwell Publishers, 108 Cowley Road, Oxford OX4 1JF, UK and 50 Main Street, Malden, MA 02148, USA. THE WELFARE IMPLICATIONS OF COSTLY MONITORING
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationFREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES
FREQUENCIES OF SUCCESSIVE PAIRS OF PRIME RESIDUES AVNER ASH, LAURA BELTIS, ROBERT GROSS, AND WARREN SINNOTT Abstract. We consider statistical roerties of the sequence of ordered airs obtained by taking
More informationMath 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
More informationThe Mathematics of GIS. Wolfgang Kainz
The Mathematics of GIS Wolfgang Kainz Wolfgang Kainz Department of Geography and Regional Research University of Vienna Universitätsstraße 7, A-00 Vienna, Austria E-Mail: wolfgang.kainz@univie.ac.at Version.
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More informationc 2009 Je rey A. Miron 3. Examples: Linear Demand Curves and Monopoly
Lecture 0: Monooly. c 009 Je rey A. Miron Outline. Introduction. Maximizing Pro ts. Examles: Linear Demand Curves and Monooly. The Ine ciency of Monooly. The Deadweight Loss of Monooly. Price Discrimination.
More informationThe Cubic Formula. The quadratic formula tells us the roots of a quadratic polynomial, a polynomial of the form ax 2 + bx + c. The roots (if b 2 b+
The Cubic Formula The quadratic formula tells us the roots of a quadratic olynomial, a olynomial of the form ax + bx + c. The roots (if b b+ 4ac 0) are b 4ac a and b b 4ac a. The cubic formula tells us
More informationRigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
More informationInteraction Expressions A Powerful Formalism for Describing Inter-Workflow Dependencies
Interaction Exressions A Powerful Formalism for Describing Inter-Workflow Deendencies Christian Heinlein, Peter Dadam Det. Databases and Information Systems University of Ulm, Germany {heinlein,dadam}@informatik.uni-ulm.de
More informationHow To Understand The Theory Of Computer Science
Theory of Computation Lecture Notes Abhijat Vichare August 2005 Contents 1 Introduction 2 What is Computation? 3 The λ Calculus 3.1 Conversions: 3.2 The calculus in use 3.3 Few Important Theorems 3.4 Worked
More informationBinary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
More informationThe risk of using the Q heterogeneity estimator for software engineering experiments
Dieste, O., Fernández, E., García-Martínez, R., Juristo, N. 11. The risk of using the Q heterogeneity estimator for software engineering exeriments. The risk of using the Q heterogeneity estimator for
More informationRummage Web Server Tuning Evaluation through Benchmark
IJCSNS International Journal of Comuter Science and Network Security, VOL.7 No.9, Setember 27 13 Rummage Web Server Tuning Evaluation through Benchmark (Case study: CLICK, and TIME Parameter) Hiyam S.
More informationNumber Theory Naoki Sato <ensato@hotmail.com>
Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an
More informationTRANSCENDENTAL NUMBERS
TRANSCENDENTAL NUMBERS JEREMY BOOHER. Introduction The Greeks tried unsuccessfully to square the circle with a comass and straightedge. In the 9th century, Lindemann showed that this is imossible by demonstrating
More informationCABRS CELLULAR AUTOMATON BASED MRI BRAIN SEGMENTATION
XI Conference "Medical Informatics & Technologies" - 2006 Rafał Henryk KARTASZYŃSKI *, Paweł MIKOŁAJCZAK ** MRI brain segmentation, CT tissue segmentation, Cellular Automaton, image rocessing, medical
More informationLogical Agents. Explorations in Artificial Intelligence. Knowledge-based Agents. Knowledge-base Agents. Outline. Knowledge bases
Logical Agents Explorations in Artificial Intelligence rof. Carla. Gomes gomes@cs.cornell.edu Agents that are able to: Form representations of the world Use a process to derive new representations of the
More informationAsymmetric Information, Transaction Cost, and. Externalities in Competitive Insurance Markets *
Asymmetric Information, Transaction Cost, and Externalities in Cometitive Insurance Markets * Jerry W. iu Deartment of Finance, University of Notre Dame, Notre Dame, IN 46556-5646 wliu@nd.edu Mark J. Browne
More informationProject Management and. Scheduling CHAPTER CONTENTS
6 Proect Management and Scheduling HAPTER ONTENTS 6.1 Introduction 6.2 Planning the Proect 6.3 Executing the Proect 6.7.1 Monitor 6.7.2 ontrol 6.7.3 losing 6.4 Proect Scheduling 6.5 ritical Path Method
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
Propositional Logic: logical operators Negation ( ) Conjunction ( ) Disjunction ( ). Exclusive or ( ) Conditional statement ( ) Bi-conditional statement ( ): Let p and q be propositions. The biconditional
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationRules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05
Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example Re-Revisited Our Old Example: Suppose we have: All human beings
More informationWOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Mid-Session Test Summer Session 008-00
More informationHow To Understand The Difference Between A Bet And A Bet On A Draw Or Draw On A Market
OPTIA EXCHANGE ETTING STRATEGY FOR WIN-DRAW-OSS ARKETS Darren O Shaughnessy a,b a Ranking Software, elbourne b Corresonding author: darren@rankingsoftware.com Abstract Since the etfair betting exchange
More informationManaging specific risk in property portfolios
Managing secific risk in roerty ortfolios Andrew Baum, PhD University of Reading, UK Peter Struemell OPC, London, UK Contact author: Andrew Baum Deartment of Real Estate and Planning University of Reading
More informationON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical and Mathematical Sciences 2012 1 p. 43 48 ON FUNCTIONAL SYMBOL-FREE LOGIC PROGRAMS I nf or m at i cs L. A. HAYKAZYAN * Chair of Programming and Information
More informationSchedule. Logic (master program) Literature & Online Material. gic. Time and Place. Literature. Exercises & Exam. Online Material
OLC mputational gic Schedule Time and Place Thursday, 8:15 9:45, HS E Logic (master program) Georg Moser Institute of Computer Science @ UIBK week 1 October 2 week 8 November 20 week 2 October 9 week 9
More informationRisk and Return. Sample chapter. e r t u i o p a s d f CHAPTER CONTENTS LEARNING OBJECTIVES. Chapter 7
Chater 7 Risk and Return LEARNING OBJECTIVES After studying this chater you should be able to: e r t u i o a s d f understand how return and risk are defined and measured understand the concet of risk
More informationSage Timberline Office
Sage Timberline Office Get Started Document Management 9.8 NOTICE This document and the Sage Timberline Office software may be used only in accordance with the accomanying Sage Timberline Office End User
More informationCircuits and Boolean Expressions
Circuits and Boolean Expressions Provided by TryEngineering - Lesson Focus Boolean logic is essential to understanding computer architecture. It is also useful in program construction and Artificial Intelligence.
More informationThe History of Logic. Aristotle (384 322 BC) invented logic.
The History of Logic Aristotle (384 322 BC) invented logic. Predecessors: Fred Flintstone, geometry, sophists, pre-socratic philosophers, Socrates & Plato. Syllogistic logic, laws of non-contradiction
More informationJena Research Papers in Business and Economics
Jena Research Paers in Business and Economics A newsvendor model with service and loss constraints Werner Jammernegg und Peter Kischka 21/2008 Jenaer Schriften zur Wirtschaftswissenschaft Working and Discussion
More informationComplex Conjugation and Polynomial Factorization
Comlex Conjugation and Polynomial Factorization Dave L. Renfro Summer 2004 Central Michigan University I. The Remainder Theorem Let P (x) be a olynomial with comlex coe cients 1 and r be a comlex number.
More informationBeyond the F Test: Effect Size Confidence Intervals and Tests of Close Fit in the Analysis of Variance and Contrast Analysis
Psychological Methods 004, Vol. 9, No., 164 18 Coyright 004 by the American Psychological Association 108-989X/04/$1.00 DOI: 10.1037/108-989X.9..164 Beyond the F Test: Effect Size Confidence Intervals
More informationPrice Elasticity of Demand MATH 104 and MATH 184 Mark Mac Lean (with assistance from Patrick Chan) 2011W
Price Elasticity of Demand MATH 104 and MATH 184 Mark Mac Lean (with assistance from Patrick Chan) 2011W The rice elasticity of demand (which is often shortened to demand elasticity) is defined to be the
More informationService Network Design with Asset Management: Formulations and Comparative Analyzes
Service Network Design with Asset Management: Formulations and Comarative Analyzes Jardar Andersen Teodor Gabriel Crainic Marielle Christiansen October 2007 CIRRELT-2007-40 Service Network Design with
More informationDISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationEQUATIONAL LOGIC AND ABSTRACT ALGEBRA * ABSTRACT
EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * Taje I. Ramsamujh Florida International University Mathematics Department ABSTRACT Equational logic is a formalization of the deductive methods encountered in studying
More informationLecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior
More informationNAVAL POSTGRADUATE SCHOOL THESIS
NAVAL POSTGRADUATE SCHOOL MONTEREY CALIFORNIA THESIS SYMMETRICAL RESIDUE-TO-BINARY CONVERSION ALGORITHM PIPELINED FPGA IMPLEMENTATION AND TESTING LOGIC FOR USE IN HIGH-SPEED FOLDING DIGITIZERS by Ross
More informationAlbert D. Rich. Soft Warehouse, Inc.
4 Simlifying Suare Roots of Suare Roots by Denesting David J. Jerey The University of Western Ontario Albert D. Rich Soft Warehouse, Inc. Abstract: We discuss why it is imortant to try to simlify the suare
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationhttp://www.ualberta.ca/~mlipsett/engm541/engm541.htm
ENGM 670 & MECE 758 Modeling and Simulation of Engineering Systems (Advanced Toics) Winter 011 Lecture 9: Extra Material M.G. Lisett University of Alberta htt://www.ualberta.ca/~mlisett/engm541/engm541.htm
More informationUniversity of Ostrava. Reasoning in Description Logic with Semantic Tableau Binary Trees
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Reasoning in Description Logic with Semantic Tableau Binary Trees Alena Lukasová Research report No. 63 2005 Submitted/to
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationCRITICAL AVIATION INFRASTRUCTURES VULNERABILITY ASSESSMENT TO TERRORIST THREATS
Review of the Air Force Academy No (23) 203 CRITICAL AVIATION INFRASTRUCTURES VULNERABILITY ASSESSMENT TO TERRORIST THREATS Cătălin CIOACĂ Henri Coandă Air Force Academy, Braşov, Romania Abstract: The
More informationo-minimality and Uniformity in n 1 Graphs
o-minimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions
More informationMulti-Channel Opportunistic Routing in Multi-Hop Wireless Networks
Multi-Channel Oortunistic Routing in Multi-Ho Wireless Networks ANATOLIJ ZUBOW, MATHIAS KURTH and JENS-PETER REDLICH Humboldt University Berlin Unter den Linden 6, D-99 Berlin, Germany (zubow kurth jr)@informatik.hu-berlin.de
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More information