the existence property among set theories
play

The Existence Property among Set Theories Michael Rathjen - PowerPoint PPT Presentation

The Existence Property among Set Theories Michael Rathjen Department of Pure Mathematics University of Leeds Eighth Panhellenic Logic Symposium Ioannina July 4 th 2011 T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY


  1. Remarks about partial EP T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  2. Remarks about partial EP • Nevertheless, fragments of the EP , known as uniformization properties , sometimes hold. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  3. Remarks about partial EP • Nevertheless, fragments of the EP , known as uniformization properties , sometimes hold. (Kondo, Addison) If ZF ⊢ ∃ x ∈ R ϕ ( x ) and ϕ ( x ) is Σ 1 2 , then 1 ZF ⊢ ∃ ! x ∈ R ϑ ( x ) and ZF ⊢ ∃ x ∈ R [ ϑ ( x ) ∧ ϕ ( x )] for some Σ 1 2 formula ϑ . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  4. Remarks about partial EP • Nevertheless, fragments of the EP , known as uniformization properties , sometimes hold. (Kondo, Addison) If ZF ⊢ ∃ x ∈ R ϕ ( x ) and ϕ ( x ) is Σ 1 2 , then 1 ZF ⊢ ∃ ! x ∈ R ϑ ( x ) and ZF ⊢ ∃ x ∈ R [ ϑ ( x ) ∧ ϕ ( x )] for some Σ 1 2 formula ϑ . (Feferman, Lévy) EP fails for Π 1 2 in ZF and ZFC . 2 T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  5. Remarks about partial EP • Nevertheless, fragments of the EP , known as uniformization properties , sometimes hold. (Kondo, Addison) If ZF ⊢ ∃ x ∈ R ϕ ( x ) and ϕ ( x ) is Σ 1 2 , then 1 ZF ⊢ ∃ ! x ∈ R ϑ ( x ) and ZF ⊢ ∃ x ∈ R [ ϑ ( x ) ∧ ϕ ( x )] for some Σ 1 2 formula ϑ . (Feferman, Lévy) EP fails for Π 1 2 in ZF and ZFC . 2 (Y. Moschovakis) ZF + Projective Determinacy has the 3 projective existence property ( ϕ ( x ) , ϑ ( x ) projective). T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  6. Classical theories and EP T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  7. Classical theories and EP • Reasonable classical set theories can have the full EP . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  8. Classical theories and EP • Reasonable classical set theories can have the full EP . Theorem An extension T of ZF has the EP if and only if T proves that all sets are ordinal definable, i.e., T ⊢ V = OD . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  9. Myhill’s Constructive set theory 1975 T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  10. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  11. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic Many sorted system: numbers, sets, functions T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  12. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic Many sorted system: numbers, sets, functions Axioms (simplified) T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  13. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic Many sorted system: numbers, sets, functions Axioms (simplified) * Extensionality T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  14. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic Many sorted system: numbers, sets, functions Axioms (simplified) * Extensionality • Pairing , Union , Infinity (or N is a set) T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  15. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic Many sorted system: numbers, sets, functions Axioms (simplified) * Extensionality • Pairing , Union , Infinity (or N is a set) • Bounded Separation T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  16. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic Many sorted system: numbers, sets, functions Axioms (simplified) * Extensionality • Pairing , Union , Infinity (or N is a set) • Bounded Separation • Exponentiation : A , B sets ⇒ A B set. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  17. Myhill’s Constructive set theory 1975 CST based on intuitionistic logic Many sorted system: numbers, sets, functions Axioms (simplified) * Extensionality • Pairing , Union , Infinity (or N is a set) • Bounded Separation • Exponentiation : A , B sets ⇒ A B set. • Replacement T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  18. Intuitionistic Zermelo-Fraenkel set theory, IZF T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  19. Intuitionistic Zermelo-Fraenkel set theory, IZF * Extensionality T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  20. Intuitionistic Zermelo-Fraenkel set theory, IZF * Extensionality • Pairing , Union , Infinity T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  21. Intuitionistic Zermelo-Fraenkel set theory, IZF * Extensionality • Pairing , Union , Infinity • Full Separation • Powerset T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  22. Intuitionistic Zermelo-Fraenkel set theory, IZF * Extensionality • Pairing , Union , Infinity • Full Separation • Powerset # Collection ( ∀ x ∈ a ) ∃ y ϕ ( x , y ) → ∃ b ( ∀ x ∈ a ) ( ∃ y ∈ b ) ϕ ( x , y ) T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  23. Intuitionistic Zermelo-Fraenkel set theory, IZF * Extensionality • Pairing , Union , Infinity • Full Separation • Powerset # Collection ( ∀ x ∈ a ) ∃ y ϕ ( x , y ) → ∃ b ( ∀ x ∈ a ) ( ∃ y ∈ b ) ϕ ( x , y ) * Set Induction ( IND ∈ ) ∀ a ( ∀ x ∈ a ϕ ( x ) → ϕ ( a )) → ∀ a ϕ ( a ) , T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  24. Intuitionistic Zermelo-Fraenkel set theory, IZF * Extensionality • Pairing , Union , Infinity • Full Separation • Powerset # Collection ( ∀ x ∈ a ) ∃ y ϕ ( x , y ) → ∃ b ( ∀ x ∈ a ) ( ∃ y ∈ b ) ϕ ( x , y ) * Set Induction ( IND ∈ ) ∀ a ( ∀ x ∈ a ϕ ( x ) → ϕ ( a )) → ∀ a ϕ ( a ) , Myhill ’s IZF R : IZF with Replacement instead of Collection T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  25. Constructive Zermelo-Fraenkel set theory, CZF T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  26. Constructive Zermelo-Fraenkel set theory, CZF * Extensionality T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  27. Constructive Zermelo-Fraenkel set theory, CZF * Extensionality • Pairing , Union , Infinity T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  28. Constructive Zermelo-Fraenkel set theory, CZF * Extensionality • Pairing , Union , Infinity • Bounded Separation T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  29. Constructive Zermelo-Fraenkel set theory, CZF * Extensionality • Pairing , Union , Infinity • Bounded Separation • Exponentiation T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  30. Constructive Zermelo-Fraenkel set theory, CZF * Extensionality • Pairing , Union , Infinity • Bounded Separation • Exponentiation # Strong Collection ( ∀ x ∈ a ) ∃ y ϕ ( x , y ) → ∃ b [ ( ∀ x ∈ a ) ( ∃ y ∈ b ) ϕ ( x , y ) ∧ ( ∀ y ∈ b ) ( ∃ x ∈ a ) ϕ ( x , y ) ] T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  31. Constructive Zermelo-Fraenkel set theory, CZF * Extensionality • Pairing , Union , Infinity • Bounded Separation • Exponentiation # Strong Collection ( ∀ x ∈ a ) ∃ y ϕ ( x , y ) → ∃ b [ ( ∀ x ∈ a ) ( ∃ y ∈ b ) ϕ ( x , y ) ∧ ( ∀ y ∈ b ) ( ∃ x ∈ a ) ϕ ( x , y ) ] * Set Induction scheme T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  32. Two types of set existence axioms T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  33. Two types of set existence axioms • Explicit set existence axioms : e.g. Separation, Replacement, Exponentiation T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  34. Two types of set existence axioms • Explicit set existence axioms : e.g. Separation, Replacement, Exponentiation • Non-explicit set existence axioms: e.g. in classical set theory Axioms of Choice T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  35. Two types of set existence axioms • Explicit set existence axioms : e.g. Separation, Replacement, Exponentiation • Non-explicit set existence axioms: e.g. in classical set theory Axioms of Choice • Non-explicit set existence axioms in intuitionistic set theory: e.g. Axioms of Choice, (Strong) Collection, Subset Collection, Regular Extension Axiom T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  36. Some History Let IZF R result from IZF by replacing Collection with Replacement, and let CST be Myhill’s constructive set theory. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  37. Some History Let IZF R result from IZF by replacing Collection with Replacement, and let CST be Myhill’s constructive set theory. Theorem 1 . (Myhill) IZF R and CST have the DP , NEP , and the EP . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  38. Some History Let IZF R result from IZF by replacing Collection with Replacement, and let CST be Myhill’s constructive set theory. Theorem 1 . (Myhill) IZF R and CST have the DP , NEP , and the EP . Theorem 2 . (Beeson) IZF has the DP and the NEP . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  39. Some History Let IZF R result from IZF by replacing Collection with Replacement, and let CST be Myhill’s constructive set theory. Theorem 1 . (Myhill) IZF R and CST have the DP , NEP , and the EP . Theorem 2 . (Beeson) IZF has the DP and the NEP . Theorem 3 . (Friedman, Scedrov) IZF does not have the EP . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  40. Realizability Theorem Realizability with truth. Theorem: (R) For every theorem θ of CZF , there exists an application term s such that CZF ⊢ ( s � t θ ) . Moreover, the proof of this soundness theorem is effective in that the application term s can be effectively constructed from the CZF proof of θ . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  41. The Main Theorem T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  42. The Main Theorem Theorem: (R) The DP and the NEP hold true for CZF , CZF + REA and CZF + Large Set Axioms. One can also add Subset Collection and the following choice principles: AC ω , DC , RDC , PAx . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  43. The Main Theorem Theorem: (R) The DP and the NEP hold true for CZF , CZF + REA and CZF + Large Set Axioms. One can also add Subset Collection and the following choice principles: AC ω , DC , RDC , PAx . Theorem: The DP and the NEP hold true for IZF , IZF + REA and IZF + Large Set Axioms. One can also add AC ω , DC , RDC , PAx . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  44. Remarks T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  45. Remarks • This notion of realizability is very robust. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  46. Remarks • This notion of realizability is very robust. Adding Powerset or other axioms to CZF doesn’t change 1 the results. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  47. Remarks • This notion of realizability is very robust. Adding Powerset or other axioms to CZF doesn’t change 1 the results. It can be adapted to other PCAs, e.g. the second Kleene 2 algebra to show that provable functions on Baire space are continuous. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  48. Remarks • This notion of realizability is very robust. Adding Powerset or other axioms to CZF doesn’t change 1 the results. It can be adapted to other PCAs, e.g. the second Kleene 2 algebra to show that provable functions on Baire space are continuous. References: T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  49. Remarks • This notion of realizability is very robust. Adding Powerset or other axioms to CZF doesn’t change 1 the results. It can be adapted to other PCAs, e.g. the second Kleene 2 algebra to show that provable functions on Baire space are continuous. References: R.: The disjunction and related properties for 1 constructive Zermelo-Fraenkel set theory. Journal of Symbolic Logic 70 (2005) 1233–1254. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  50. Remarks • This notion of realizability is very robust. Adding Powerset or other axioms to CZF doesn’t change 1 the results. It can be adapted to other PCAs, e.g. the second Kleene 2 algebra to show that provable functions on Baire space are continuous. References: R.: The disjunction and related properties for 1 constructive Zermelo-Fraenkel set theory. Journal of Symbolic Logic 70 (2005) 1233–1254. R.: Metamathematical Properties of Intuitionistic Set 2 Theories with Choice Principles. In: S. B. Cooper, B. Löwe, A. Sorbi (eds.): New Computational Paradigms: Changing Conceptions of What is Computable (Springer, New York, 2008) 287–312. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  51. Failure of EP for IZF T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  52. Failure of EP for IZF Collection is ∀ x ∈ a ∃ y A ( x , y ) → ∃ b ∀ x ∈ a ∃ y ∈ b A ( x , y ) . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  53. Failure of EP for IZF Collection is ∀ x ∈ a ∃ y A ( x , y ) → ∃ b ∀ x ∈ a ∃ y ∈ b A ( x , y ) . This is in IZF equivalent to ∃ b [ ∀ x ∈ a ∃ y A ( x , y ) → ∀ x ∈ a ∃ y ∈ b A ( x , y )] T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  54. Failure of EP for IZF Collection is ∀ x ∈ a ∃ y A ( x , y ) → ∃ b ∀ x ∈ a ∃ y ∈ b A ( x , y ) . This is in IZF equivalent to ∃ b [ ∀ x ∈ a ∃ y A ( x , y ) → ∀ x ∈ a ∃ y ∈ b A ( x , y )] • Let B ( z ) be a formula expressing that z is an uncountable cardinal. Let B ∗ ( z ) result from B ( z ) by replacing every atomic subformula D of B ( z ) by D ∨ ∀ uv ( u ∈ v ∨ ¬ u ∈ v ) . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  55. Failure of EP for IZF Collection is ∀ x ∈ a ∃ y A ( x , y ) → ∃ b ∀ x ∈ a ∃ y ∈ b A ( x , y ) . This is in IZF equivalent to ∃ b [ ∀ x ∈ a ∃ y A ( x , y ) → ∀ x ∈ a ∃ y ∈ b A ( x , y )] • Let B ( z ) be a formula expressing that z is an uncountable cardinal. Let B ∗ ( z ) result from B ( z ) by replacing every atomic subformula D of B ( z ) by D ∨ ∀ uv ( u ∈ v ∨ ¬ u ∈ v ) . EP fails for IZF for the following instance: ∃ y [ ∀ x ∈ 1 ∃ z B ∗ ( z ) → ∀ x ∈ 1 ∃ z ∈ y B ∗ ( z )] . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  56. Problems T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  57. Problems • (Beeson 1985) Does any reasonable set theory with Collection have the existential definability property? T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  58. The Weak Existence Property T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  59. The Weak Existence Property T has the weak existence property , wEP , if whenever T ⊢ ∃ x φ ( x ) holds for a formula φ ( x ) having at most the free variable x , then there is a formula ϑ ( x ) with exactly x free, so that T ⊢ ∃ ! x ϑ ( x ) , ⊢ ∀ x [ ϑ ( x ) → ∃ u u ∈ x ] , T T ⊢ ∀ x [ ϑ ( x ) → ∀ u ∈ x φ ( u )] . T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  60. Extended E -recursive functions T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  61. Extended E -recursive functions • We would like to have unlimited application of sets to sets, i.e. we would like to assign a meaning to the symbol { a } ( x ) where a and x are sets. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  62. Extended E -recursive functions • We would like to have unlimited application of sets to sets, i.e. we would like to assign a meaning to the symbol { a } ( x ) where a and x are sets. • Known as E -recursion or set recursion T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  63. Extended E -recursive functions • We would like to have unlimited application of sets to sets, i.e. we would like to assign a meaning to the symbol { a } ( x ) where a and x are sets. • Known as E -recursion or set recursion • However, we shall introduce an extended notion of E -computability, christened E ℘ -computability , rendering the function a b exp ( a , b ) = computable as well. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

  64. Extended E -recursive functions • We would like to have unlimited application of sets to sets, i.e. we would like to assign a meaning to the symbol { a } ( x ) where a and x are sets. • Known as E -recursion or set recursion • However, we shall introduce an extended notion of E -computability, christened E ℘ -computability , rendering the function a b exp ( a , b ) = computable as well. • Classically, E ℘ -computability is related to power recursion , where the power set operation is regarded to be an initial function. Notion studied by Yiannis Moschovakis and Larry Moss. T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES T HE E XISTENCE P ROPERTY AMONG S ET T HEORIES

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend