Question

In: Computer Science

Problem ( Proving theorems!) For each of the following statements, translate it into predicate logic and...

Problem ( Proving theorems!)

For each of the following statements, translate it into predicate logic and prove it, if the statement is true, or disprove it, otherwise:

  1. 1.

    for any positive integer, there exists a second positive the square of which is equal to the first integer,

  2. 2.

    for any positive integer, there exists a second positive integer which is greater or equal to the square of the the first integer,

  3. 3.

    for any positive integer, there exists a second positive which is greater or equal to the square of the the first integer, but smaller than the cube of the the first integer.

Solutions

Expert Solution

If a statement is true, we need to prove it in generalised way. But if a statement is false, one point/example is enough to prove it.

1: Statement 1 is FALSE.
Statement:  
For any positive integer (say, 1,2,3,4). there exist a second positive integer whose square is equal to 1st integer.
This fails for I1 = positive integer which is not perfect square (eg, 2, 3, 5, 6, 7, ...).

2: Statement 2 is TRUE
Statement: F
or any positive integer, there exists a second positive integer which is greater or equal to the square of the the first integer.
Square of 1st integer is also an integer. Since integer goes till INFINITY, hence, for all N from positive integer set, there exist an N+1 in positive integer set..

3: Statement 3 is FALSE
Statement: For any positive integer, there exists a second positive which is greater or equal to the square of the the first integer, but smaller than the cube of the the first integer.
Positive integers are {1,2,3,4,5,...}
The statement holds for N > 1 in positive Integer set. But for N=1 in the set, square of 1 is 1 and cube is also 1.
According to statement, N12 <= N2 < N13
But 1<=1<1 doesnot hold true for 2nd inequality.

Hope it helps.


Related Solutions

4. Translate each of the following statements into a symbolic logic and tell if each of...
4. Translate each of the following statements into a symbolic logic and tell if each of the following is true or false, with a full justification (you do not have to justify your answer to (ii), which was done before) : (i) Every integer has an additive inverse. (ii) If a and b are any integers such that b > 0, then there exist integers q and r such that a = bq + r, where 0 ≤ r <...
When proving theorems, mathematicians consider most frequently four statements: 1. the conditional statement 2. the converse...
When proving theorems, mathematicians consider most frequently four statements: 1. the conditional statement 2. the converse to the conditional statement 3. the inverse 4. the contrapositive Among those four statements, which ones require negation of parts, or all, of the conditional statement? When negating a statement, for which keywords must you search? How are they negated?
in Philosophy 160 Deductive Logic II, Prove in predicate logic with identity that there is at...
in Philosophy 160 Deductive Logic II, Prove in predicate logic with identity that there is at least one solution to Hilbert's set of simultaneous equations from the premise that there's exactly one solution to them. Do not combine two steps into one. Sx : x is a solution to Hilbert's set of simultaneous equations.
Represent with the language of First Order Predicate Logic the following proposition: "If S is an...
Represent with the language of First Order Predicate Logic the following proposition: "If S is an arbitrary set of objects for which there is an associative binary operation * (function) with the following two properties: (1) for every pair of objects 'a' and 'b' from S there exists and object 'c' such that a * b = c (left solution property), then there exists in S an object 'e' such that e * x = x for all x in...
Digital Logic Design Lab Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits...
Digital Logic Design Lab Prove the following Boolean Algebra theorems and properties by constructing Logic Circuits for each theorem/properties using our educational simulation software: Q1-a) The Distributive Property:     a + ( b . c ) = ( a + b ) . ( a + c ) Q1-b) The Distributive Property:     a . ( b + c ) = ( a . b ) + ( a . c )
How is Logics such as (Predicate Logic, Propositional Logic, and Logical Reasoning) used in Computer Science?...
How is Logics such as (Predicate Logic, Propositional Logic, and Logical Reasoning) used in Computer Science? Examples of how it implies to computer science would be great.
Translate the following sentence into sentential logic. It is not true that ATHLETICISM is a necessary...
Translate the following sentence into sentential logic. It is not true that ATHLETICISM is a necessary and sufficient condition for FITNESS.
Conceptually the two most common logics are propositional logic and Predicate Logic. An undergraduate student who...
Conceptually the two most common logics are propositional logic and Predicate Logic. An undergraduate student who took a course of discrete mathematics is inquiring as to how propositional and predicate logics can be used in software testing. How are ask to guide this student in this quest. One pointer may consist in presenting the characteristics and limitations of both logic as well as their use as a mean for software testing. Which Logic is most adequate for formal verification of...
a) Translate the following sentence into a symbolic logic form. If John will work only if...
a) Translate the following sentence into a symbolic logic form. If John will work only if he gets a raise, then we should get him a raise if we want the job done. Use the following notations in your translation. W: John works. R: John does get a raise. S: We should get John a raise. D: We want the job done. b) Give the contraposition of your answer in (a) . Try to simplify the logical form as much...
Introduction to logic: Translate each argument using the letters provided and prove the argument valid using...
Introduction to logic: Translate each argument using the letters provided and prove the argument valid using all eight rules of implication. Sam will finish his taxes and Donna pay her property taxes or Sam will finish his taxes and Henry will go to the DMV. If Sam finishes his taxes, then his errands will be done and he will be stress-free for a time. Therefore, Sam will finish his taxes and he will be stress-free for a time. (S, D,...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT