Тёмный

8.3 Change of Quantifier Rule 

Mark Thorsby
Подписаться 46 тыс.
Просмотров 10 тыс.
50% 1

Опубликовано:

 

16 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 14   
@UhelUhel
@UhelUhel 8 лет назад
I don't know if you read this comment but you must know that this Videos are much better than my Elementary logic classes. Thank you ;)
@pranit13a
@pranit13a 11 лет назад
i dont know how to thank u..this whole series of videos are really helpful..u teach in such a way that complex things look simple and i m really enjoying solving logic problem....keep up the good work mate..thank u so much man..
@bahar1054
@bahar1054 5 лет назад
I wish you were my teacher :( My teacher can't even solve his own quiz problems that he gives to us. These youtube videos have helped and TAUGHT me so much for my online class. My own online teacher taught me nothing.
@tmendoza6
@tmendoza6 6 лет назад
I read the book, pause listen to lecture , then finish the Chapter you are setting the example! thank you again
@Oblivescent
@Oblivescent 12 лет назад
thank you SO much for this. i wish i'd seen your videos months ago, instead of tonight as i'm studying for my introductory logic final!
@tmendoza6
@tmendoza6 6 лет назад
“We can speak and think only of what exists. And what exists is uncreated and imperishable for it is whole and unchanging and complete. It was not or nor shall be different since it is now, all at once, one and continuous.” ― Parmenides
@entivreality
@entivreality 7 лет назад
Professor Thorsby, At 5:04, you say that we are allowed to apply an existential generalization onto a statement function, not only a statement name. Doesn't this allow us to exploit universals in such a way as to commit the existential fallacy? Or does the existential fallacy not apply in first-order logic? I'm a little confused. For example: 1. (∀x)(Cx > Dx) 2. Cx > Dx ||| 1, UI 3. (∃x)(Cx > Dx) ||| 2, EG Thanks a lot for all of your great videos! Logic is one of my favorite courses now.
@jasonhw7565
@jasonhw7565 5 лет назад
Hi Professor Thorsby, I got some doubts, which I need to trouble you for. [1] For UI, why is there a need to perform EI first? I hear that the existence of the variable a is required for UI to proceed. [2] For simplification, why is there a need to commutate first? e.g. Ra · ~Qa, then ~Qa·Ra , Kind regards.
@jasonhw7565
@jasonhw7565 5 лет назад
[3] Hi Professor, is it possible to apply change of quantifier to "[Ǝx]~Ax v [Ǝx]~Bx" to "~[x]Ax v ~[x]Bx"?
@melisalasell6422
@melisalasell6422 8 лет назад
Does anyone have a resource or a hint for finding the solution on 8.3, Part 1 #14 ???? Stumped in Sacramento...
@CadaverSplatter
@CadaverSplatter 7 лет назад
I find a god way to remember the change of quantifier rules is this, since it limits it to two statements of equivalence, and applies to either quantifier: 1) Positive quantifier and positive function= negative inverse quantifier and negative function. 2) Negative quantifier and and positive function= positive inverse quantifier and negative function.
@JohnnieCYP
@JohnnieCYP 5 лет назад
Oh, Hi Mark!
@Zen-lz1hc
@Zen-lz1hc 2 года назад
Like :)
@infonode1783
@infonode1783 5 лет назад
Lines 3 to 4 do not logically follow. Just because there exists something which is not an L, it does not follow that nothing is an L.
Далее
7.4  Rules of Replacement II
32:05
Просмотров 19 тыс.
7.1  Rules of Implication I
53:04
Просмотров 45 тыс.
7.3  Rules of Replacement I
52:49
Просмотров 36 тыс.
8.1  Predicate Logic:  Symbols & Translation
57:47
Просмотров 73 тыс.
8.5  Predciate Logic: Finite Universe Method
1:08:52
Просмотров 9 тыс.
6.1 Symbols & Translation
49:03
Просмотров 50 тыс.
7.2  Rules of Implication II
43:06
Просмотров 29 тыс.
7.5  Conditional Proof
24:59
Просмотров 29 тыс.
1.1 Logic Basics #1
18:24
Просмотров 572
6.2  Truth Functions
57:49
Просмотров 41 тыс.
1.4  Validity, Truth, Soundness, Strength, Cogency
34:26
5.7  Sorites
32:21
Просмотров 12 тыс.