logic1

76
INTRODUCTION TO LOGIC Sets, Relations, and Arguments Volker Halbach Pure logic is the ruin of the spirit. Antoine de Saint-Exupéry

description

logic

Transcript of logic1

Page 1: logic1

INTRODUCTION TO LOGIC

1 Sets, Relations, and Arguments

Volker Halbach

Pure logic is the ruin of the spirit.Antoine de Saint-Exupéry

Page 2: logic1

Practicalities

�e Logic Manual

web page for the book: http://logicmanual.philosophy.ox.ac.uk/Exercises Bookletslides of the lecturesworked examplespast examination papers with solutions

Mark Sainsbury: Logical Forms: An Introduction to PhilosophicalLogic, Blackwell, second edition, 2001

Page 3: logic1

Practicalities

�e Logic Manual

web page for the book: http://logicmanual.philosophy.ox.ac.uk/Exercises Booklet

slides of the lecturesworked examplespast examination papers with solutions

Mark Sainsbury: Logical Forms: An Introduction to PhilosophicalLogic, Blackwell, second edition, 2001

Page 4: logic1

Practicalities

�e Logic Manual

web page for the book: http://logicmanual.philosophy.ox.ac.uk/Exercises Bookletslides of the lectures

worked examplespast examination papers with solutions

Mark Sainsbury: Logical Forms: An Introduction to PhilosophicalLogic, Blackwell, second edition, 2001

Page 5: logic1

Practicalities

�e Logic Manual

web page for the book: http://logicmanual.philosophy.ox.ac.uk/Exercises Bookletslides of the lecturesworked examples

past examination papers with solutionsMark Sainsbury: Logical Forms: An Introduction to PhilosophicalLogic, Blackwell, second edition, 2001

Page 6: logic1

Practicalities

�e Logic Manual

web page for the book: http://logicmanual.philosophy.ox.ac.uk/Exercises Bookletslides of the lecturesworked examplespast examination papers with solutions

Mark Sainsbury: Logical Forms: An Introduction to PhilosophicalLogic, Blackwell, second edition, 2001

Page 7: logic1

Practicalities

�e Logic Manual

web page for the book: http://logicmanual.philosophy.ox.ac.uk/Exercises Bookletslides of the lecturesworked examplespast examination papers with solutions

Mark Sainsbury: Logical Forms: An Introduction to PhilosophicalLogic, Blackwell, second edition, 2001

Page 8: logic1

Practicalities

Why logic?

You’ll need it to understand philosophical texts and to discussphilosophy.

Philosophy is about arguments and reasoning. Logicians re�ecton how we reason and what constitutes correct reasoning.

Logic provides one with tools to show that certain claims do notfollow from certain assumptions.

Tools from logic are used not only in philosophy but also inlinguistics, mathematics, computer science, and other subjects.

Page 9: logic1

Practicalities

Why logic?

You’ll need it to understand philosophical texts and to discussphilosophy.

Philosophy is about arguments and reasoning. Logicians re�ecton how we reason and what constitutes correct reasoning.

Logic provides one with tools to show that certain claims do notfollow from certain assumptions.

Tools from logic are used not only in philosophy but also inlinguistics, mathematics, computer science, and other subjects.

Page 10: logic1

Practicalities

Why logic?

You’ll need it to understand philosophical texts and to discussphilosophy.

Philosophy is about arguments and reasoning. Logicians re�ecton how we reason and what constitutes correct reasoning.

Logic provides one with tools to show that certain claims do notfollow from certain assumptions.

Tools from logic are used not only in philosophy but also inlinguistics, mathematics, computer science, and other subjects.

Page 11: logic1

Practicalities

Why logic?

You’ll need it to understand philosophical texts and to discussphilosophy.

Philosophy is about arguments and reasoning. Logicians re�ecton how we reason and what constitutes correct reasoning.

Logic provides one with tools to show that certain claims do notfollow from certain assumptions.

Tools from logic are used not only in philosophy but also inlinguistics, mathematics, computer science, and other subjects.

Page 12: logic1

Practicalities

Why logic?

You’ll need it to understand philosophical texts and to discussphilosophy.

Philosophy is about arguments and reasoning. Logicians re�ecton how we reason and what constitutes correct reasoning.

Logic provides one with tools to show that certain claims do notfollow from certain assumptions.

Tools from logic are used not only in philosophy but also inlinguistics, mathematics, computer science, and other subjects.

Page 13: logic1

1.5 Arguments, Validity, and Contradiction

Arguments

De�nitionSentences that are true or false are called declarative sentences.In what follows I will focus exclusively on declarative sentences.

De�nitionAn argument consists of a set of declarative sentences (thepremisses) and a declarative sentence (the conclusion) marked asthe concluded sentence.

Page 14: logic1

1.5 Arguments, Validity, and Contradiction

Arguments

De�nitionSentences that are true or false are called declarative sentences.In what follows I will focus exclusively on declarative sentences.

De�nitionAn argument consists of a set of declarative sentences (thepremisses) and a declarative sentence (the conclusion) marked asthe concluded sentence.

Page 15: logic1

1.5 Arguments, Validity, and Contradiction

ExampleI’m not dreaming if I can see the computer in front of me. I cansee the computer in front of me. �erefore I’m not dreaming.

‘I’m not dreaming if I can see the computer in front of me’ is the�rst premiss.

‘I can see the computer in front of me’ is the second premiss.

‘I’m not dreaming’ is the conclusion, which is marked by‘therefore’.

Page 16: logic1

1.5 Arguments, Validity, and Contradiction

ExampleI’m not dreaming if I can see the computer in front of me. I cansee the computer in front of me. �erefore I’m not dreaming.

‘I’m not dreaming if I can see the computer in front of me’ is the�rst premiss.

‘I can see the computer in front of me’ is the second premiss.

‘I’m not dreaming’ is the conclusion, which is marked by‘therefore’.

Page 17: logic1

1.5 Arguments, Validity, and Contradiction

ExampleI’m not dreaming if I can see the computer in front of me. I cansee the computer in front of me. �erefore I’m not dreaming.

‘I’m not dreaming if I can see the computer in front of me’ is the�rst premiss.

‘I can see the computer in front of me’ is the second premiss.

‘I’m not dreaming’ is the conclusion, which is marked by‘therefore’.

Page 18: logic1

1.5 Arguments, Validity, and Contradiction

ExampleI’m not dreaming if I can see the computer in front of me. I cansee the computer in front of me. �erefore I’m not dreaming.

‘I’m not dreaming if I can see the computer in front of me’ is the�rst premiss.

‘I can see the computer in front of me’ is the second premiss.

‘I’m not dreaming’ is the conclusion, which is marked by‘therefore’.

Page 19: logic1

1.5 Arguments, Validity, and Contradiction

Occasionally the conclusion precedes the premisses or is foundbetween premisses. �e conclusion needn’t be marked as such.

Alternative ways to express the argument:

ExampleI’m not dreaming. For if I can see the computer in front of me I’mnot dreaming, and I can see the computer in front of me.

ExampleI’m not dreaming, if I can see the computer in front of me. �us,I’m not dreaming. �is is because I can see the computer in frontof me.30

Page 20: logic1

1.5 Arguments, Validity, and Contradiction

Occasionally the conclusion precedes the premisses or is foundbetween premisses. �e conclusion needn’t be marked as such.

Alternative ways to express the argument:

ExampleI’m not dreaming. For if I can see the computer in front of me I’mnot dreaming, and I can see the computer in front of me.

ExampleI’m not dreaming, if I can see the computer in front of me. �us,I’m not dreaming. �is is because I can see the computer in frontof me.30

Page 21: logic1

1.5 Arguments, Validity, and Contradiction

Occasionally the conclusion precedes the premisses or is foundbetween premisses. �e conclusion needn’t be marked as such.

Alternative ways to express the argument:

ExampleI’m not dreaming. For if I can see the computer in front of me I’mnot dreaming, and I can see the computer in front of me.

ExampleI’m not dreaming, if I can see the computer in front of me. �us,I’m not dreaming. �is is because I can see the computer in frontof me.30

Page 22: logic1

1.5 Arguments, Validity, and Contradiction

Occasionally the conclusion precedes the premisses or is foundbetween premisses. �e conclusion needn’t be marked as such.

Alternative ways to express the argument:

ExampleI’m not dreaming. For if I can see the computer in front of me I’mnot dreaming, and I can see the computer in front of me.

ExampleI’m not dreaming, if I can see the computer in front of me. �us,I’m not dreaming. �is is because I can see the computer in frontof me.30

Page 23: logic1

1.5 Arguments, Validity, and Contradiction

�e point of ‘good’ arguments is that they take one from truepremisses to true conclusions. Many arguments with thisproperty exhibit certain patterns.

ExampleI’m not dreaming if I can see the computer in front of me. I cansee the computer in front of me. �erefore I’m not dreaming.

ExampleFiona can open the dvi-�le if yap is installed. yap is installed.�erefore Fiona can open the dvi-�le.

Logicians are interested in the patterns of ‘good’ arguments thatcannot take one from true premisses to a false conclusion.

Page 24: logic1

1.5 Arguments, Validity, and Contradiction

�e point of ‘good’ arguments is that they take one from truepremisses to true conclusions. Many arguments with thisproperty exhibit certain patterns.

ExampleI’m not dreaming if I can see the computer in front of me. I cansee the computer in front of me. �erefore I’m not dreaming.

ExampleFiona can open the dvi-�le if yap is installed. yap is installed.�erefore Fiona can open the dvi-�le.

Logicians are interested in the patterns of ‘good’ arguments thatcannot take one from true premisses to a false conclusion.

Page 25: logic1

1.5 Arguments, Validity, and Contradiction

�e point of ‘good’ arguments is that they take one from truepremisses to true conclusions. Many arguments with thisproperty exhibit certain patterns.

ExampleI’m not dreaming if I can see the computer in front of me. I cansee the computer in front of me. �erefore I’m not dreaming.

ExampleFiona can open the dvi-�le if yap is installed. yap is installed.�erefore Fiona can open the dvi-�le.

Logicians are interested in the patterns of ‘good’ arguments thatcannot take one from true premisses to a false conclusion.

Page 26: logic1

1.5 Arguments, Validity, and Contradiction

CharacterisationAn argument is logically (or formally) valid if and only if there isno interpretation under which the premisses are all true and theconclusion is false.

ExampleZeno is a tortoise. All tortoises are toothless. �erefore Zeno istoothless.

ExampleSocrates is a man. All men are mortal. �erefore Socrates ismortal.

Page 27: logic1

1.5 Arguments, Validity, and Contradiction

CharacterisationAn argument is logically (or formally) valid if and only if there isno interpretation under which the premisses are all true and theconclusion is false.

ExampleZeno is a tortoise. All tortoises are toothless. �erefore Zeno istoothless.

ExampleSocrates is a man. All men are mortal. �erefore Socrates ismortal.

Page 28: logic1

1.5 Arguments, Validity, and Contradiction

CharacterisationAn argument is logically (or formally) valid if and only if there isno interpretation under which the premisses are all true and theconclusion is false.

ExampleZeno is a tortoise. All tortoises are toothless. �erefore Zeno istoothless.

ExampleSocrates is a man. All men are mortal. �erefore Socrates ismortal.

Page 29: logic1

1.5 Arguments, Validity, and Contradiction

Features of logically valid arguments:�e truth of the conclusion follows from the truth of thepremisses independently what the subject-speci�cexpressions mean. Whatever tortoises are, whoever Zeno is,whatever exists: if the premisses of the argument are true theconclusion will be true.

�e truth of the conclusion follows from the truth of thepremisses purely in virtue of the ‘form’ of the argument andindependently of any subject-speci�c assumptions.It’s not possible that the premisses of a logically validargument are true and that its conclusion is false.In a logically valid argument the conclusion can be false (inthat case at least one of its premisses is false).

See also Sainsbury for a discussion.

Page 30: logic1

1.5 Arguments, Validity, and Contradiction

Features of logically valid arguments:�e truth of the conclusion follows from the truth of thepremisses independently what the subject-speci�cexpressions mean. Whatever tortoises are, whoever Zeno is,whatever exists: if the premisses of the argument are true theconclusion will be true.�e truth of the conclusion follows from the truth of thepremisses purely in virtue of the ‘form’ of the argument andindependently of any subject-speci�c assumptions.

It’s not possible that the premisses of a logically validargument are true and that its conclusion is false.In a logically valid argument the conclusion can be false (inthat case at least one of its premisses is false).

See also Sainsbury for a discussion.

Page 31: logic1

1.5 Arguments, Validity, and Contradiction

Features of logically valid arguments:�e truth of the conclusion follows from the truth of thepremisses independently what the subject-speci�cexpressions mean. Whatever tortoises are, whoever Zeno is,whatever exists: if the premisses of the argument are true theconclusion will be true.�e truth of the conclusion follows from the truth of thepremisses purely in virtue of the ‘form’ of the argument andindependently of any subject-speci�c assumptions.It’s not possible that the premisses of a logically validargument are true and that its conclusion is false.

In a logically valid argument the conclusion can be false (inthat case at least one of its premisses is false).

See also Sainsbury for a discussion.

Page 32: logic1

1.5 Arguments, Validity, and Contradiction

Features of logically valid arguments:�e truth of the conclusion follows from the truth of thepremisses independently what the subject-speci�cexpressions mean. Whatever tortoises are, whoever Zeno is,whatever exists: if the premisses of the argument are true theconclusion will be true.�e truth of the conclusion follows from the truth of thepremisses purely in virtue of the ‘form’ of the argument andindependently of any subject-speci�c assumptions.It’s not possible that the premisses of a logically validargument are true and that its conclusion is false.In a logically valid argument the conclusion can be false (inthat case at least one of its premisses is false).

See also Sainsbury for a discussion.

Page 33: logic1

1.5 Arguments, Validity, and Contradiction

�e following argument isn’t logically valid:

ExampleEvery eu citizen can enter the us without a visa. Max is a citizenof Sweden. �erefore Max can enter the us without a visa.

However, one can transform it into a logically valid argument byadding a premiss:

ExampleEvery eu citizen can enter the us without a visa. Max is a citizenof Sweden. Every citizen of Sweden is a eu citizen. �erefore Maxcan enter the us without a visa.

Page 34: logic1

1.5 Arguments, Validity, and Contradiction

�e following argument isn’t logically valid:

ExampleEvery eu citizen can enter the us without a visa. Max is a citizenof Sweden. �erefore Max can enter the us without a visa.However, one can transform it into a logically valid argument byadding a premiss:

ExampleEvery eu citizen can enter the us without a visa. Max is a citizenof Sweden. Every citizen of Sweden is a eu citizen. �erefore Maxcan enter the us without a visa.

Page 35: logic1

1.5 Arguments, Validity, and Contradiction

Characterisation (consistency)A set of sentences is consistent if and only if there is a least oneinterpretation under which all sentences of the set are true.

Characterisation (logical truth)

A sentence is logically true if and only if it is true under anyinterpretation.

‘All metaphysicians are metaphysicians.’

Page 36: logic1

1.5 Arguments, Validity, and Contradiction

Characterisation (consistency)A set of sentences is consistent if and only if there is a least oneinterpretation under which all sentences of the set are true.

Characterisation (logical truth)

A sentence is logically true if and only if it is true under anyinterpretation.

‘All metaphysicians are metaphysicians.’

Page 37: logic1

1.5 Arguments, Validity, and Contradiction

Characterisation (contradiction)A sentence is a contradiction if and only if it is false under anyinterpretation.

‘Some metaphysicians who are also ethicists aren’tmetaphysicians.’

I’ll make these notions precise for the formal languages orpropositional and predicate logic.20

Page 38: logic1

1.5 Arguments, Validity, and Contradiction

Characterisation (contradiction)A sentence is a contradiction if and only if it is false under anyinterpretation.

‘Some metaphysicians who are also ethicists aren’tmetaphysicians.’

I’ll make these notions precise for the formal languages orpropositional and predicate logic.20

Page 39: logic1

1.1 Sets

Sets

�e following is not really logic in the strict sense but we’ll need itlater and it is useful in other areas as well.

CharacterisationA set is a collection of objects.

�e objects in the set are the elements of the set.

�ere is a set that has exactly all books as elements.�ere is a set that has Volker Halbach as its only element.

Page 40: logic1

1.1 Sets

Sets

�e following is not really logic in the strict sense but we’ll need itlater and it is useful in other areas as well.

CharacterisationA set is a collection of objects.

�e objects in the set are the elements of the set.

�ere is a set that has exactly all books as elements.�ere is a set that has Volker Halbach as its only element.

Page 41: logic1

1.1 Sets

Sets

�e following is not really logic in the strict sense but we’ll need itlater and it is useful in other areas as well.

CharacterisationA set is a collection of objects.

�e objects in the set are the elements of the set.

�ere is a set that has exactly all books as elements.�ere is a set that has Volker Halbach as its only element.

Page 42: logic1

1.1 Sets

Sets

�e following is not really logic in the strict sense but we’ll need itlater and it is useful in other areas as well.

CharacterisationA set is a collection of objects.

�e objects in the set are the elements of the set.

�ere is a set that has exactly all books as elements.

�ere is a set that has Volker Halbach as its only element.

Page 43: logic1

1.1 Sets

Sets

�e following is not really logic in the strict sense but we’ll need itlater and it is useful in other areas as well.

CharacterisationA set is a collection of objects.

�e objects in the set are the elements of the set.

�ere is a set that has exactly all books as elements.�ere is a set that has Volker Halbach as its only element.

Page 44: logic1

1.1 Sets

Sets are identical if and only if they have the same elements.

Example�e set of all animals with kidneys and the set of all animals witha heart are identical, because exactly those animals that havekidneys also have a heart and vice versa.

Page 45: logic1

1.1 Sets

�e claim ‘a is an element of S’ can be written as ‘a ∈ S’. One alsosays ‘S contains a’ or ‘a is in S’.

�ere is exactly one set with no elements. �e symbol for this setis ‘∅’.�e set {Oxford, ∅, Volker Halbach} has as its elements exactlythree things: Oxford, the empty set ∅, and me.

Here is another way to denote sets:

{ d ∶ d is an animal with a heart}

is the set of all animals with a heart. It has as its elements exactlyall animals with a heart.

Page 46: logic1

1.1 Sets

�e claim ‘a is an element of S’ can be written as ‘a ∈ S’. One alsosays ‘S contains a’ or ‘a is in S’.

�ere is exactly one set with no elements. �e symbol for this setis ‘∅’.

�e set {Oxford, ∅, Volker Halbach} has as its elements exactlythree things: Oxford, the empty set ∅, and me.

Here is another way to denote sets:

{ d ∶ d is an animal with a heart}

is the set of all animals with a heart. It has as its elements exactlyall animals with a heart.

Page 47: logic1

1.1 Sets

�e claim ‘a is an element of S’ can be written as ‘a ∈ S’. One alsosays ‘S contains a’ or ‘a is in S’.

�ere is exactly one set with no elements. �e symbol for this setis ‘∅’.�e set {Oxford, ∅, Volker Halbach} has as its elements exactlythree things: Oxford, the empty set ∅, and me.

Here is another way to denote sets:

{ d ∶ d is an animal with a heart}

is the set of all animals with a heart. It has as its elements exactlyall animals with a heart.

Page 48: logic1

1.1 Sets

�e claim ‘a is an element of S’ can be written as ‘a ∈ S’. One alsosays ‘S contains a’ or ‘a is in S’.

�ere is exactly one set with no elements. �e symbol for this setis ‘∅’.�e set {Oxford, ∅, Volker Halbach} has as its elements exactlythree things: Oxford, the empty set ∅, and me.

Here is another way to denote sets:

{ d ∶ d is an animal with a heart}

is the set of all animals with a heart. It has as its elements exactlyall animals with a heart.

Page 49: logic1

1.1 Sets

Example{Oxford, ∅, Volker Halbach} = {Volker Halbach, Oxford, ∅ }

Example{the capital of England, Munich} = {London, Munich, thecapital of England}

ExampleMars ∈ {d ∶ d is a planet }

Example∅ ∈ {∅}

Page 50: logic1

1.1 Sets

Example{Oxford, ∅, Volker Halbach} = {Volker Halbach, Oxford, ∅ }

Example{the capital of England, Munich} = {London, Munich, thecapital of England}

ExampleMars ∈ {d ∶ d is a planet }

Example∅ ∈ {∅}

Page 51: logic1

1.1 Sets

Example{Oxford, ∅, Volker Halbach} = {Volker Halbach, Oxford, ∅ }

Example{the capital of England, Munich} = {London, Munich, thecapital of England}

ExampleMars ∈ {d ∶ d is a planet }

Example∅ ∈ {∅}

Page 52: logic1

1.1 Sets

Example{Oxford, ∅, Volker Halbach} = {Volker Halbach, Oxford, ∅ }

Example{the capital of England, Munich} = {London, Munich, thecapital of England}

ExampleMars ∈ {d ∶ d is a planet }

Example∅ ∈ {∅}

Page 53: logic1

1.2 Binary relations

Relations

�e set {London, Munich} is the same set as {Munich, London}.

�e ordered pair ⟨London, Munich⟩ is di�erent from the orderedpair ⟨Munich, London⟩.Ordered pairs are identical if and only if the agree in their �rstand second components, or more formally:

⟨d , e⟩ = ⟨ f , g⟩ i� (d = f and e = g)

�e abbreviation ‘i�’ stands for ‘if and only if’.

�ere are also triples (3-tuples) like ⟨London, Munich, Rome⟩,quadruples, 5-tuples, 6-tuples etc.

Page 54: logic1

1.2 Binary relations

Relations

�e set {London, Munich} is the same set as {Munich, London}.�e ordered pair ⟨London, Munich⟩ is di�erent from the orderedpair ⟨Munich, London⟩.

Ordered pairs are identical if and only if the agree in their �rstand second components, or more formally:

⟨d , e⟩ = ⟨ f , g⟩ i� (d = f and e = g)

�e abbreviation ‘i�’ stands for ‘if and only if’.

�ere are also triples (3-tuples) like ⟨London, Munich, Rome⟩,quadruples, 5-tuples, 6-tuples etc.

Page 55: logic1

1.2 Binary relations

Relations

�e set {London, Munich} is the same set as {Munich, London}.�e ordered pair ⟨London, Munich⟩ is di�erent from the orderedpair ⟨Munich, London⟩.Ordered pairs are identical if and only if the agree in their �rstand second components, or more formally:

⟨d , e⟩ = ⟨ f , g⟩ i� (d = f and e = g)

�e abbreviation ‘i�’ stands for ‘if and only if’.

�ere are also triples (3-tuples) like ⟨London, Munich, Rome⟩,quadruples, 5-tuples, 6-tuples etc.

Page 56: logic1

1.2 Binary relations

Relations

�e set {London, Munich} is the same set as {Munich, London}.�e ordered pair ⟨London, Munich⟩ is di�erent from the orderedpair ⟨Munich, London⟩.Ordered pairs are identical if and only if the agree in their �rstand second components, or more formally:

⟨d , e⟩ = ⟨ f , g⟩ i� (d = f and e = g)

�e abbreviation ‘i�’ stands for ‘if and only if’.

�ere are also triples (3-tuples) like ⟨London, Munich, Rome⟩,quadruples, 5-tuples, 6-tuples etc.

Page 57: logic1

1.2 Binary relations

Relations

�e set {London, Munich} is the same set as {Munich, London}.�e ordered pair ⟨London, Munich⟩ is di�erent from the orderedpair ⟨Munich, London⟩.Ordered pairs are identical if and only if the agree in their �rstand second components, or more formally:

⟨d , e⟩ = ⟨ f , g⟩ i� (d = f and e = g)

�e abbreviation ‘i�’ stands for ‘if and only if’.

�ere are also triples (3-tuples) like ⟨London, Munich, Rome⟩,quadruples, 5-tuples, 6-tuples etc.

Page 58: logic1

1.2 Binary relations

De�nitionA set is a binary relation if and only if it contains only orderedpairs.

�e empty set ∅ doesn’t contain anything that’s not an orderedpair; therefore it’s a relation.

Example�e relation of being a bigger city than is the set {⟨London,Munich⟩, ⟨London, Birmingham⟩, ⟨Paris, Milan⟩. . .}.

Page 59: logic1

1.2 Binary relations

De�nitionA set is a binary relation if and only if it contains only orderedpairs.

�e empty set ∅ doesn’t contain anything that’s not an orderedpair; therefore it’s a relation.

Example�e relation of being a bigger city than is the set {⟨London,Munich⟩, ⟨London, Birmingham⟩, ⟨Paris, Milan⟩. . .}.

Page 60: logic1

1.2 Binary relations

De�nitionA set is a binary relation if and only if it contains only orderedpairs.

�e empty set ∅ doesn’t contain anything that’s not an orderedpair; therefore it’s a relation.

Example�e relation of being a bigger city than is the set {⟨London,Munich⟩, ⟨London, Birmingham⟩, ⟨Paris, Milan⟩. . .}.

Page 61: logic1

1.2 Binary relations

�e following set is a binary relation:

{⟨France, Italy⟩, ⟨Italy, Austria⟩, ⟨France, France⟩,⟨Italy, Italy⟩, ⟨Austria, Austria⟩}

Some relations can be visualised by diagrams. Every paircorresponds to an arrow:

France

$$III

IIII

II

��Austria

��

Italy

::uuuuuuuuu

VV

Page 62: logic1

1.2 Binary relations

�e following set is a binary relation:

{⟨France, Italy⟩, ⟨Italy, Austria⟩, ⟨France, France⟩,⟨Italy, Italy⟩, ⟨Austria, Austria⟩}

Some relations can be visualised by diagrams. Every paircorresponds to an arrow:

France

$$III

IIII

II

��Austria

��

Italy

::uuuuuuuuu

VV

Page 63: logic1

1.2 Binary relations

I’ll mention only some properties of relations.

De�nitionA binary relation R is symmetric i� for all d , e: if ⟨d , e⟩ ∈ R then⟨e , d⟩ ∈ R.

�e relation with the following diagram isn’t symmetric:

France��

��

Austria

zzuuuuuuuuu

ItalyVV

]]

�e pair ⟨Austria, Italy⟩ is in the relation, but the pair ⟨Italy,Austria⟩ isn’t.

Page 64: logic1

1.2 Binary relations

I’ll mention only some properties of relations.

De�nitionA binary relation R is symmetric i� for all d , e: if ⟨d , e⟩ ∈ R then⟨e , d⟩ ∈ R.

�e relation with the following diagram isn’t symmetric:

France��

��

Austria

zzuuuuuuuuu

ItalyVV

]]

�e pair ⟨Austria, Italy⟩ is in the relation, but the pair ⟨Italy,Austria⟩ isn’t.

Page 65: logic1

1.2 Binary relations

I’ll mention only some properties of relations.

De�nitionA binary relation R is symmetric i� for all d , e: if ⟨d , e⟩ ∈ R then⟨e , d⟩ ∈ R.

�e relation with the following diagram isn’t symmetric:

France��

��

Austria

zzuuuuuuuuu

ItalyVV

]]

�e pair ⟨Austria, Italy⟩ is in the relation, but the pair ⟨Italy,Austria⟩ isn’t.

Page 66: logic1

1.2 Binary relations

�e relation with the following diagram is symmetric.

France��

��

Austria

vvItalyVV

]] 77

Page 67: logic1

1.2 Binary relations

De�nitionA binary relation is transitive i� for all d , e , f : if ⟨d , e⟩ ∈ R and⟨e , f ⟩ ∈ R, then also ⟨d , f ⟩ ∈ RIn the diagram of a transitive relation there is for any two-arrowway from an point to a point a direct arrow.

�is is the diagram of a relation that’s not transitive:

France // Austria // Italy

�is is the diagram of a relation that is transitive:

France // --Austria // Italy

Page 68: logic1

1.2 Binary relations

De�nitionA binary relation is transitive i� for all d , e , f : if ⟨d , e⟩ ∈ R and⟨e , f ⟩ ∈ R, then also ⟨d , f ⟩ ∈ RIn the diagram of a transitive relation there is for any two-arrowway from an point to a point a direct arrow.

�is is the diagram of a relation that’s not transitive:

France // Austria // Italy

�is is the diagram of a relation that is transitive:

France // --Austria // Italy

Page 69: logic1

1.2 Binary relations

De�nitionA binary relation R is re�exive on a set S i� for all d in S the pair⟨d , d⟩ is an element of R.

�e relation with the following diagram is re�exive on the set{France, Austria, Italy}.

France

$$III

IIII

II

��Austria

��

Italy

::uuuuuuuuu

VV

Page 70: logic1

1.2 Binary relations

De�nitionA binary relation R is re�exive on a set S i� for all d in S the pair⟨d , d⟩ is an element of R.

�e relation with the following diagram is re�exive on the set{France, Austria, Italy}.

France

$$III

IIII

II

��Austria

��

Italy

::uuuuuuuuu

VV

Page 71: logic1

1.2 Binary relations

�e relation with the following diagram is not re�exive on{France, Austria, Italy}, but re�exive on {France, Austria}:

France

$$III

IIII

II

��Austria

��

Italy

::uuuuuuuuu

Page 72: logic1

1.3 Functions

FunctionsDe�nitionA binary relation R is a function i� for all d , e , f : if ⟨d , e⟩ ∈ R and⟨d , f ⟩ ∈ R then e = f .

�e relation with the following diagram is a function:

France

$$III

IIII

IIAustria

zzuuuuuuuuu

ItalyVV

�ere is at most one arrow leaving from every point in thediagram of a function.

Page 73: logic1

1.3 Functions

FunctionsDe�nitionA binary relation R is a function i� for all d , e , f : if ⟨d , e⟩ ∈ R and⟨d , f ⟩ ∈ R then e = f .

�e relation with the following diagram is a function:

France

$$III

IIII

IIAustria

zzuuuuuuuuu

ItalyVV

�ere is at most one arrow leaving from every point in thediagram of a function.

Page 74: logic1

1.3 Functions

Example�e set of all ordered pairs ⟨d , e⟩ such that e is mother of d is afunction.�is justi�es talking about themother of so-and-so.

You might know examples of the following kind from school:

Example�e set of all pairs ⟨d , d2⟩ where d is some real number is afunction.One can’t write down all the pairs, but the function would looklike this: {⟨2, 4⟩, ⟨1, 1⟩, ⟨5, 25⟩, ⟨ 12 , 1

4⟩ . . .}One also think of a function as something that yields an ‘output’,e.g. 25 when given an input, e.g. 5, or that ‘assigns the value 25 tothe argument 5’.

Page 75: logic1

1.3 Functions

Example�e set of all ordered pairs ⟨d , e⟩ such that e is mother of d is afunction.�is justi�es talking about themother of so-and-so.

You might know examples of the following kind from school:

Example�e set of all pairs ⟨d , d2⟩ where d is some real number is afunction.One can’t write down all the pairs, but the function would looklike this: {⟨2, 4⟩, ⟨1, 1⟩, ⟨5, 25⟩, ⟨ 12 , 1

4⟩ . . .}

One also think of a function as something that yields an ‘output’,e.g. 25 when given an input, e.g. 5, or that ‘assigns the value 25 tothe argument 5’.

Page 76: logic1

1.3 Functions

Example�e set of all ordered pairs ⟨d , e⟩ such that e is mother of d is afunction.�is justi�es talking about themother of so-and-so.

You might know examples of the following kind from school:

Example�e set of all pairs ⟨d , d2⟩ where d is some real number is afunction.One can’t write down all the pairs, but the function would looklike this: {⟨2, 4⟩, ⟨1, 1⟩, ⟨5, 25⟩, ⟨ 12 , 1

4⟩ . . .}One also think of a function as something that yields an ‘output’,e.g. 25 when given an input, e.g. 5, or that ‘assigns the value 25 tothe argument 5’.