Search for tag: "universe"

Kaltura Capture recording - November 14th 2020, 1:49:20 pm

lecture 9 part 1

From  Pauline Phemister on November 14th, 2020 0 likes 9 plays 0  

CL - 12e - More Counting

In this video we look at yet another pattern of implications, and apply our a method for counting the satisfying valuations.

From  Haoran Peng on November 9th, 2020 0 likes 293 plays 0  

CL - 12a - Order

This video looks at the ordering of predicates. We first met thsis as the satisfaction ordering a ⊨ b.We look at the ordering of the 16 possible boolean functions of two variables. We can also view…

From  Haoran Peng on November 9th, 2020 0 likes 315 plays 0  

CL - 7h - Some Haskell remarks

In this video we give an example showing how Haskell's types can help us to avoid confusions.We then discuss the types of the Boolean operations lifted to predicates, and show how…

From  Haoran Peng on November 1st, 2020 0 likes 234 plays 0  

lecture 7 part 3 Kaltura Capture recording - October 31st 2020, 9:29:37 pm

lecture 7 part 3

From  Pauline Phemister on October 31st, 2020 0 likes 11 plays 0  

CL - 5x - Supplementary on Sequents

This video includes a couple of points from a 2019 review lecture on Sequents.First we discuss how to use reduction to find an inhabited model in which Γ ⊨ Δ, which is equivalent to…

From  Haoran Peng on October 30th, 2020 0 likes 14 plays 0  

CL - 6b - Karnaugh Maps I

In logic, we call the things in the universal model valuations; they are Boolean-values functions defined on the set of predicates.In computer science we often call these states, because, as we will…

From  Haoran Peng on October 24th, 2020 0 likes 409 plays 0  

CL - 6a - Keeping it Simple

We begin by revisiting the idea of a universal model. If we have only n predicates then we can distinguish only 2n kinds of individual. So we only need to consider 2^{2n} universes. For example, for…

From  Haoran Peng on October 24th, 2020 0 likes 396 plays 0  

CL - Barbara

Gentzen's rules provide a complete system that does not require the cut rule. For many logical systems, cut elimination (showing that uses of the cut rule may be eliminated from any sound proof)…

From  Haoran Peng on October 21st, 2020 0 likes 275 plays 0  

CL - Implication

We derive the implication rule using the rules introduced last week.

From  Haoran Peng on October 20th, 2020 0 likes 369 plays 0  

CL - Sequents

We introduce sequents, where we have finite sets of predicates on both sides of the turnstile.

From  Haoran Peng on October 20th, 2020 0 likes 328 plays 0  

CL - Review 2 - Venn Apples

Venn diagrams on a sphere.

From  Haoran Peng on October 20th, 2020 0 likes 307 plays 0  

CL - Review 1 - Contraposition

We show the intuition of contraposition using Venn diagrams.

From  Haoran Peng on October 20th, 2020 0 likes 335 plays 0  

CL - Lecture 4.i - Reduction 1

We use the rules to reduce a sequent to a conjunction of simpler sequents. In this example we find that the expression asserted by the sequent is a tautology — it is equivalent to the empty…

From  Claudia-Elena Chirita on October 15th, 2020 0 likes 382 plays 0