consider the following sentences. Your task is to determine whether the corresponding formula to the right is an instance of that sentence. Write “YES” under the appropriate column depending on whether the formula is an instance of the sentence.
consider the following sentences. Your task is to determine whether the corresponding formula to the right is an instance of that sentence. Write “YES” under the appropriate column depending on whether the formula is an instance of the sentence.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
100%
In this problem, consider the following sentences. Your task is to determine whether the corresponding formula to the right is an instance of that sentence. Write “YES” under the appropriate column depending on whether the formula is an instance of the sentence.
(The image with the chart is the question)
(The other image is just formulas if your not familiar with this)

Transcribed Image Text:We are now in a position do describe quantified relational logic
for one or two place relations only. Remember that to specify a
logic I need to tell you (1) the formal symbols, (2) the
transformation rules, and (3) closure condition.
The formal symbols are:
· a, b, c, . . . , m, n, . . . as constant symbols for terms. A term is
anything in a theory or language that can be given a proper
name or an object that can be identified uniquely.
- x, y, z as symbols for variables, which range over terms.
- Upper case letters P, Q, R, S, T, . . . , A, B, C, D, . . . , M, . . . of
alphabet as symbols for relations (on two place
the
only).
- Truth-functional connectives: V, ^, , , ↔
- Quantifiers: V
- Brackets: ( for left bracket and ) for right bracket.
In order to talk about formulas at a meta-level we use the
symbols F, G and H.
The transformation rules for quantified relational logic are:
1. For any predicate symbol P and for any two place relation
symbol R, given any constants a or b or any variables x or y,
Pa, Px, Rab, Rxy are formulas. In Px and Rxy formulas, x and
y are said to "free" variables because there are no quantifiers to
which they are bound.
2. If F is a formula by Rule 1 and if x is a free variable in F, then
3x F is a formula and Vx F is a formula. Rule 2 is known as
binding any free variable x in F by a quantifier.
A formula F formed by either rule 1 and 2 is called an atomic
formula.
3. If F and G are atomic formulas, then -F, (F v G), (F ^ G),
· G) and (F ↔ G) are complex formulas.
(F
4. If H is a complex formula, then the result of binding any free
variable in H is a formula.

Transcribed Image Text:Sentence
3x Lxx
hxThExE
3x³y Lxy
3x Lax
3xLxa
VxLxx
3xLxy
Lab
3x Lax
Laa
3x Lxx
Formula
Lab
3xLxa
By Lby
Laa
Laa
Lba
Lxb
Lab
Laa
Laa
Lbc
Vzy(Lzz → Lyx) || y(Laa → Lyx)
Vzy(Lzy → Lyz)
(Lab→ Lba)
VzVy(Lzy → Lyz)
(Lab→ Lba)
3zVy(Lzy → Lyz)
(Lbb → Lba)
zy(Lzy → Lyz)
(Lab→ Lba)
Vzy (Lzz → Lyy)
(Laa → Lba)
Vzy (Lyz Lzz)
(Lab → Lbb)
Vyz(Lzz → Lzy)
(Laa → Lba)
Vzy (Lyy → Lzy)
(Lbb → Lba)
Instance Not an instance
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 7 steps

Recommended textbooks for you

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated

Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY

Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,

