Axiom of Choice, Maximal Independent Sets, Argumentation and - PowerPoint PPT Presentation

Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games Christof Spanring Department of Computer Science, University of Liverpool, UK Institute of Information Systems, Vienna University of Technology, Austria PhDs Tea Talk Liverpool, October 3, 2014

Outline Introduction 1 Games and Motivations Infinity and Questions Backgrounds 2 Zermelo-Fraenkel Set Theory and related Axioms Games Again, Infinite Style The Stuff 3 Abstract Argumentation An Equivalence Proof Christof Spanring, PhDs Tea Talk Choice and Argumentation 2 / 16

A minor example Example (Games played on Argument Graphs) Can you defend an argument a beyond doubt, i.e. defeat any attackers without running into conflict with your own argument base? Who has a winning strategy, you as the proponent or your oponent? . . . a c b Christof Spanring, PhDs Tea Talk Choice and Argumentation 3 / 16

A minor example Example (Games played on Argument Graphs) Can you defend an argument a beyond doubt, i.e. defeat any attackers without running into conflict with your own argument base? Who has a winning strategy, you as the proponent or your oponent? . . . a c b d Christof Spanring, PhDs Tea Talk Choice and Argumentation 3 / 16

A minor example Example (Games played on Argument Graphs) Can you defend an argument a beyond doubt, i.e. defeat any attackers without running into conflict with your own argument base? Who has a winning strategy, you as the proponent or your oponent? . . . . . . a c b d Christof Spanring, PhDs Tea Talk Choice and Argumentation 3 / 16

The Why? of Infinities I Question How many prime numbers are there? Christof Spanring, PhDs Tea Talk Choice and Argumentation 4 / 16

The Why? of Infinities I Question How many prime numbers are there? Question How many rational numbers p q are there? Christof Spanring, PhDs Tea Talk Choice and Argumentation 4 / 16

The Why? of Infinities I Question How many prime numbers are there? Question How many rational numbers p q are there? Question How many decimal numbers are there? Christof Spanring, PhDs Tea Talk Choice and Argumentation 4 / 16

The Why? of Infinities I Question How many prime numbers are there? Question How many rational numbers p q are there? Question How many decimal numbers are there? Question Is there a set of all sets? Christof Spanring, PhDs Tea Talk Choice and Argumentation 4 / 16

The Why? of Infinities II Example ( | Q | = | N | ) Example ( | N | < | R | ) There are only as many rational There are more real than natural as natural numbers. numbers. . . . 1 2 3 4 i 1 = 0 . i 1 , 1 i 1 , 2 i 1 , 3 i 1 , 4 · · · 1 1 1 1 1 2 3 4 . . . i 2 = 0 . · · · i 2 , 1 i 2 , 2 i 2 , 3 i 2 , 4 2 2 2 2 . . . i 3 = 0 . 1 2 3 4 i 3 , 1 i 3 , 2 i 3 , 3 i 3 , 4 · · · 3 3 3 3 1 2 3 4 . . . i 4 = 0 . i 4 , 1 i 4 , 2 i 4 , 3 i 4 , 4 · · · 4 4 4 4 . . . . . . . . . . . . . . . . . . Christof Spanring, PhDs Tea Talk Choice and Argumentation 5 / 16

The Why? of Infinities II Example ( | Q | = | N | ) Example ( | N | < | R | ) There are only as many rational There are more real than natural as natural numbers. numbers. . . . 1 2 3 4 i 1 = 0 . i 1 , 1 i 1 , 2 i 1 , 3 i 1 , 4 · · · 1 1 1 1 1 2 3 4 . . . i 2 = 0 . · · · i 2 , 1 i 2 , 2 i 2 , 3 i 2 , 4 2 2 2 2 . . . i 3 = 0 . 1 2 3 4 i 3 , 1 i 3 , 2 i 3 , 3 i 3 , 4 · · · 3 3 3 3 1 2 3 4 . . . i 4 = 0 . i 4 , 1 i 4 , 2 i 4 , 3 i 4 , 4 · · · 4 4 4 4 . . . . . . . . . . . . . . . . . . Christof Spanring, PhDs Tea Talk Choice and Argumentation 5 / 16

The Why? of Infinities II Example ( | Q | = | N | ) Example ( | N | < | R | ) There are only as many rational There are more real than natural as natural numbers. numbers. . . . 1 2 3 4 i 1 = 0 . i 1 , 1 i 1 , 1 i 1 , 2 i 1 , 3 i 1 , 4 · · · 1 1 1 1 1 2 3 4 . . . i 2 = 0 . · · · i 2 , 1 i 2 , 2 i 2 , 2 i 2 , 3 i 2 , 4 2 2 2 2 . . . i 3 = 0 . 1 2 3 4 i 3 , 1 i 3 , 2 i 3 , 3 i 3 , 3 i 3 , 4 · · · 3 3 3 3 1 2 3 4 . . . i 4 = 0 . i 4 , 1 i 4 , 2 i 4 , 3 i 4 , 4 i 4 , 4 · · · 4 4 4 4 . . . . . . . . . . . . . . . . . . Christof Spanring, PhDs Tea Talk Choice and Argumentation 5 / 16

Outline Introduction 1 Games and Motivations Infinity and Questions Backgrounds 2 Zermelo-Fraenkel Set Theory and related Axioms Games Again, Infinite Style The Stuff 3 Abstract Argumentation An Equivalence Proof Christof Spanring, PhDs Tea Talk Choice and Argumentation 6 / 16

Set Theory Definition Zermelo-Fraenkel Set Theory (ZFC-Axioms) ∀ x ∀ y ( ∀ z ( z ∈ x ⇔ z ∈ y ) ⇒ x = y ) Extensionality 1 ∀ x ( ∃ a ( a ∈ x ) ⇒ ∃ y ( y ∈ x ∧ ¬∃ z ( z ∈ y ∧ z ∈ x ))) Foundation 2 ∀ z ∀ v 1 ∀ v 2 · · · ∀ v n ∃ y ∀ x ( x ∈ y ⇔ ( x ∈ z ∧ ϕ )) Specification 3 ∀ x ∀ y ∃ z ( x ∈ z ∧ y ∈ z ) Pairing 4 ∀ x ∃ z ∀ y ∀ v (( v ∈ y ∧ y ∈ x ) ⇒ v ∈ z ) Union 5 Replacement 6 ∀ x ∀ v 1 ∀ v 2 · · · ∀ v n ( ∀ y ( y ∈ x ⇒ ∃ ! z ϕ ) ⇒ ∃ w ∀ y ( y ∈ x ⇒ ∃ ! z ( y ∈ w ∧ ϕ )) ∃ x ( ∅ ∈ x ∧ ∀ y ( y ∈ x ⇒ ( y ∪ { y } ) ∈ x )) Infinity 7 Power Set ∀ x ∃ y ∀ z ( z ⊆ x ⇒ z ∈ y ) 8 ∀ x ( ∅ �∈ x ⇒ ∃ f : x → � x , ∀ a ∈ x ( f ( a ) ∈ a )) Choice 9 Christof Spanring, PhDs Tea Talk Choice and Argumentation 7 / 16

Set Theory Definition Zermelo-Fraenkel Set Theory (ZFC-Axioms) ∀ x ∀ y ( ∀ z ( z ∈ x ⇔ z ∈ y ) ⇒ x = y ) Extensionality 1 ∀ x ( ∃ a ( a ∈ x ) ⇒ ∃ y ( y ∈ x ∧ ¬∃ z ( z ∈ y ∧ z ∈ x ))) Foundation 2 ∀ z ∀ v 1 ∀ v 2 · · · ∀ v n ∃ y ∀ x ( x ∈ y ⇔ ( x ∈ z ∧ ϕ )) Specification 3 ∀ x ∀ y ∃ z ( x ∈ z ∧ y ∈ z ) Pairing 4 ∀ x ∃ z ∀ y ∀ v (( v ∈ y ∧ y ∈ x ) ⇒ v ∈ z ) Union 5 Replacement 6 ∀ x ∀ v 1 ∀ v 2 · · · ∀ v n ( ∀ y ( y ∈ x ⇒ ∃ ! z ϕ ) ⇒ ∃ w ∀ y ( y ∈ x ⇒ ∃ ! z ( y ∈ w ∧ ϕ )) ∃ x ( ∅ ∈ x ∧ ∀ y ( y ∈ x ⇒ ( y ∪ { y } ) ∈ x )) Infinity 7 Power Set ∀ x ∃ y ∀ z ( z ⊆ x ⇒ z ∈ y ) 8 ∀ x ( ∅ �∈ x ⇒ ∃ f : x → � x , ∀ a ∈ x ( f ( a ) ∈ a )) Choice 9 Christof Spanring, PhDs Tea Talk Choice and Argumentation 7 / 16

Set Theory Definition Zermelo-Fraenkel Set Theory (ZFC-Axioms) ∀ x ∀ y ( ∀ z ( z ∈ x ⇔ z ∈ y ) ⇒ x = y ) Extensionality 1 ∀ x ( ∃ a ( a ∈ x ) ⇒ ∃ y ( y ∈ x ∧ ¬∃ z ( z ∈ y ∧ z ∈ x ))) Foundation 2 ∀ z ∀ v 1 ∀ v 2 · · · ∀ v n ∃ y ∀ x ( x ∈ y ⇔ ( x ∈ z ∧ ϕ )) Specification 3 ∀ x ∀ y ∃ z ( x ∈ z ∧ y ∈ z ) Pairing 4 ∀ x ∃ z ∀ y ∀ v (( v ∈ y ∧ y ∈ x ) ⇒ v ∈ z ) Union 5 Replacement 6 ∀ x ∀ v 1 ∀ v 2 · · · ∀ v n ( ∀ y ( y ∈ x ⇒ ∃ ! z ϕ ) ⇒ ∃ w ∀ y ( y ∈ x ⇒ ∃ ! z ( y ∈ w ∧ ϕ )) ∃ x ( ∅ ∈ x ∧ ∀ y ( y ∈ x ⇒ ( y ∪ { y } ) ∈ x )) Infinity 7 Power Set ∀ x ∃ y ∀ z ( z ⊆ x ⇒ z ∈ y ) 8 ∀ x ( ∅ �∈ x ⇒ ∃ f : x → � x , ∀ a ∈ x ( f ( a ) ∈ a )) Choice 9 Christof Spanring, PhDs Tea Talk Choice and Argumentation 7 / 16

Set Theory Definition Zermelo-Fraenkel Set Theory (ZFC-Axioms) ∀ x ∀ y ( ∀ z ( z ∈ x ⇔ z ∈ y ) ⇒ x = y ) Extensionality 1 ∀ x ( ∃ a ( a ∈ x ) ⇒ ∃ y ( y ∈ x ∧ ¬∃ z ( z ∈ y ∧ z ∈ x ))) Foundation 2 ∀ z ∀ v 1 ∀ v 2 · · · ∀ v n ∃ y ∀ x ( x ∈ y ⇔ ( x ∈ z ∧ ϕ )) Specification 3 ∀ x ∀ y ∃ z ( x ∈ z ∧ y ∈ z ) Pairing 4 ∀ x ∃ z ∀ y ∀ v (( v ∈ y ∧ y ∈ x ) ⇒ v ∈ z ) Union 5 Replacement 6 ∀ x ∀ v 1 ∀ v 2 · · · ∀ v n ( ∀ y ( y ∈ x ⇒ ∃ ! z ϕ ) ⇒ ∃ w ∀ y ( y ∈ x ⇒ ∃ ! z ( y ∈ w ∧ ϕ )) ∃ x ( ∅ ∈ x ∧ ∀ y ( y ∈ x ⇒ ( y ∪ { y } ) ∈ x )) Infinity 7 Power Set ∀ x ∃ y ∀ z ( z ⊆ x ⇒ z ∈ y ) 8 ∀ x ( ∅ �∈ x ⇒ ∃ f : x → � x , ∀ a ∈ x ( f ( a ) ∈ a )) Choice 9 Christof Spanring, PhDs Tea Talk Choice and Argumentation 7 / 16

Choice and Companions Example (The Axiom of Choice) Every set of non-empty sets has a choice function, selecting exactly one element from each set. Christof Spanring, PhDs Tea Talk Choice and Argumentation 8 / 16

Choice and Companions Example (The Axiom of Choice) Every set of non-empty sets has a choice function, selecting exactly one element from each set. Example (Basis Theorem for Vector Spaces) Every vector space has a basis. Christof Spanring, PhDs Tea Talk Choice and Argumentation 8 / 16

Choice and Companions Example (The Axiom of Choice) Every set of non-empty sets has a choice function, selecting exactly one element from each set. Example (Basis Theorem for Vector Spaces) Every vector space has a basis. Example (Well-ordering Theorem) Every set can be well-ordered. Christof Spanring, PhDs Tea Talk Choice and Argumentation 8 / 16

Choice and Companions Example (The Axiom of Choice) Every set of non-empty sets has a choice function, selecting exactly one element from each set. Example (Basis Theorem for Vector Spaces) Every vector space has a basis. Example (Well-ordering Theorem) Every set can be well-ordered. Example (Zorn’s Lemma) If any chain of a non-empty partially ordered set has an upper bound then there is at least one maximal element. Christof Spanring, PhDs Tea Talk Choice and Argumentation 8 / 16