First Order Logic Flashcards
4 Logical symbols
-
Punctuation: parentheses and commas:
(
and)
and,
-
Connectives:
∧
,∨
,¬
,→
-
Quantifiers:
∃
,∀
-
Variables: an infinite supply of these, usually written
x
,y
etc and sometimesx₁
,x₂
, etc.
3 Non-logical symbols
- Constant symbols
- Relation symbols
- Proposition symbols
Terms
Terms are linguistic entities that can refer to individual things.
Don’t confuse terms with formulas, which can have truth values.
3 Rules for building terms
- Every variable is a term.
- Every constant symbol is a term.
- Nothing else is a term.
Formulas
Things in the language that can have truth values.
Don’t confuse formulas with terms, which can refer to individual things.
5 Rules for formulas
- Every propositional symbol is a formula
- If
P
is a predicate symbol of arityn≥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.
4 Items required to specify an interpretation
- 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 ann
-ary relation onD
. - For each propositional symbol, give a truth value.
The domain
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)
3 Properties of equality (binary relation)
- Reflexive
- Transitive
- Symmetric
Valuation
Given an interpretation I
with a domain D
, a valuation means a function that gives an element of D
for each variable.
Free variables
A variable which is not quantified in an explicit way
Bound variables
A variable which is associated to a quantifier.
Formal definition of interpretation
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.
Formal definition of a valuation
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
Definition of truth
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
.