Let the language L be defined by the following non-logical symbols: two function symbols f1,1; f2,1, equality symbol, and constant symbol c1. Let M :=< N, fM, SM.=, c > be the normal L-structure where fM(n) := n°, fM (m, n) := m + n for all m,n e N, and c := 3. Fix the state /ā : X → N defined by z; + i, i e N. Find the value of the term f2,1(f1,1(72), f2,1(7s, f1,1(cı))) and determine if M satisfies the formula Vrz f1,1(r3) = f2,1(17, T8) in this state. 3. (b) Let the language L have only one relation symbol R1,1. Does the L-structure M :=< N, {n € N: nis even} > satisfy the sentence 3r,VI,R1,1(1), i.e. MEr, Va, R1.1 (71)? Justify your answer.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Let the language L be defined by the following non-logical
symbols: two function symbols f1,1; f2,1, equality symbol, and constant symbol c1.
Let M :=< N, fM, fM.=, c > be the normal L-structure where fM (n) := n',
fM (m, n) := m +n for all m,n e N, and c := 3. Fix the state /d : X → N
defined by z; +i, i e N. Find the value of the term f2,1(f1,1(r2), f2,1(1s, f1,1(cı)))
and determine if M satisfies the formula Vr, f1,1(13) = f2,1(17, 1s) in this state.
3.
(b) Let the language L have only one relation symbol R1,1. Does the L-structure
M:=< N, {n €N :n is even} > satisfy the sentence 3r,Va,R1,1(x1), i.e.
ME 3r, Va, R1,1(1)? Justify your answer.
Transcribed Image Text:Let the language L be defined by the following non-logical symbols: two function symbols f1,1; f2,1, equality symbol, and constant symbol c1. Let M :=< N, fM, fM.=, c > be the normal L-structure where fM (n) := n', fM (m, n) := m +n for all m,n e N, and c := 3. Fix the state /d : X → N defined by z; +i, i e N. Find the value of the term f2,1(f1,1(r2), f2,1(1s, f1,1(cı))) and determine if M satisfies the formula Vr, f1,1(13) = f2,1(17, 1s) in this state. 3. (b) Let the language L have only one relation symbol R1,1. Does the L-structure M:=< N, {n €N :n is even} > satisfy the sentence 3r,Va,R1,1(x1), i.e. ME 3r, Va, R1,1(1)? Justify your answer.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY