6. Introduction to Higher Order Logic in Isabelle Flashcards

1
Q

Define lambda abstraction

A

Terms that denote functions directly by the rules that define them.

(λx. x * x) 3 = 9

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are the two primitive functions in HOL?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How are predicates represented in HOL?

A

functions of type (alpha => bool)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How are sets represented in HOL?

A

As predicates

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How is true defined in HOL?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How is universal quantification represented in HOL?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How is conjunction represented in HOL?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How is disjunction defined in HOL?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly