First Order Logic Flashcards

1
Q

4 Logical symbols

A
  • Punctuation: parentheses and commas: ( and ) and ,
  • Connectives: , , ¬,
  • Quantifiers: ,
  • Variables: an infinite supply of these, usually written x, y etc and sometimes x₁, x₂, etc.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

3 Non-logical symbols

A
  • Constant symbols
  • Relation symbols
  • Proposition symbols
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Terms

A

Terms are linguistic entities that can refer to individual things.

Don’t confuse terms with formulas, which can have truth values.

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

3 Rules for building terms

A
  • Every variable is a term.
  • Every constant symbol is a term.
  • Nothing else is a term.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Formulas

A

Things in the language that can have truth values.

Don’t confuse formulas with terms, which can refer to individual things.

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

5 Rules for formulas

A
  • Every propositional symbol is a formula
  • If P is a predicate symbol of arity n≥1 and t₁, …, tₙ are terms, then P(t₁, …, tₙ) is a formula.
  • If ɑ and β are formulas, then these are formulas:
    • ¬ɑ
    • (ɑ ∨ β)
    • (ɑ ∧ β)
  • If x is a variable and ɑ is a formula, then ∀x ɑ and ∃x ɑ are formulas.
  • Nothing else is a formula.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

4 Items required to specify an interpretation

A
  • Give a non-empty set, D, called the domain.
  • For each constant symbol, give the element of D for it.
  • For each n-ary relation symbol, give an n-ary relation on D.
  • For each propositional symbol, give a truth value.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The domain

A

There is no restriction on what the elements of D are:

  • They can be abstract (numbers, symbols, mathematical structures such as sets.
  • They can be physical concrete things in the real world.
  • They can be concepts used in the world (e.g. time)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

3 Properties of equality (binary relation)

A
  • Reflexive
  • Transitive
  • Symmetric
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Valuation

A

Given an interpretation I with a domain D, a valuation means a function that gives an element of D for each variable.

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

Free variables

A

A variable which is not quantified in an explicit way

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

Bound variables

A

A variable which is associated to a quantifier.

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

Formal definition of interpretation

A

Given a first order language, L, an interpretation for L is a pair (D, I) where:
- D is a non-empty set, called the domain, and
- I is a function which:
- to each constant symbol c of L assigns an element I(c) ∈ D
- to each n-ary predicate symbol P, ( n > 0 ), assigns an n-ary relation I(P) ⊆ D^n,
- to each propositional constant q, assigns a truth value I(q).

Sometimes I is called a structure.

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

Formal definition of a valuation

A

Given a structure (D, I) for a language L, a valuation is a function from the set of all variables to D.

Given a valuation V, a variable x and d ∈ D, we define the valuation V[ x → d ] to be the same as V for every variable other than x, and x gets sent to d.

V[ x → d ] (u) =
V(u) if u is not x.
d if u is x

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

Definition of truth

A

For a structure A = (D, I) and a valuation v and a formula φ, the notation

A, V ⊧ φ

will mean that φ is true in the structure A under the valuation V.

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

Sentence

A

A formula with no free variables.