Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

Tags

#chapter-1 #jaynes_probability_theory

Question

Example of "reduction to disjunctive normal" method in logic

Hint: size

Hint: size

Answer

Proving that there is a finite number of propositions (functions)

E.g. C = B ^ A is a proposition, that depends on 2 variables. There is a finite number of such propositions.

E.g. C = B ^ A is a proposition, that depends on 2 variables. There is a finite number of such propositions.

Tags

#chapter-1 #jaynes_probability_theory

Question

Example of "reduction to disjunctive normal" method in logic

Hint: size

Hint: size

Answer

?

Tags

#chapter-1 #jaynes_probability_theory

Question

Example of "reduction to disjunctive normal" method in logic

Hint: size

Hint: size

Answer

Proving that there is a finite number of propositions (functions)

E.g. C = B ^ A is a proposition, that depends on 2 variables. There is a finite number of such propositions.

E.g. C = B ^ A is a proposition, that depends on 2 variables. There is a finite number of such propositions.

If you want to change selection, open document below and click on "Move attachment"

#### pdfs

- owner: reshreshus - (no access) - JaynesProbabilityTheory.pdf, p15
- owner: hhhedw - (no access) - [概率论沉思录].Probability.Theory---The.Logic.Of.Science.pdf, p45

status | not learned | measured difficulty | 37% [default] | last interval [days] | |||
---|---|---|---|---|---|---|---|

repetition number in this series | 0 | memorised on | scheduled repetition | ||||

scheduled repetition interval | last repetition or drill |

Do you want to join discussion? Click here to log in or create user.