De Morgan's law, which choice is logically equivalent to allowing predicate statement:

Construct proof for the following argument within the system of sentential logic: 1. ~(~D ⊃ ~C) ⊃ ~B            Premise2. ~B ⊃ A                            Premise3. (Y V C) & (~C V ~A)     Premise    /: . D V (A V Y)

Convert each of the following argu- ments into formal statements, e.g., define sentences existentially and/or universally quantified statements. Then determine which rules of logic have been applied and explain whether or not they have been ap- plied correctly. if you do the homework you will pass the final. Somebody did not pass the final. Therefore somebody did not not do the homework. If you do the homework you will pass the final. Curly did not do the homework. Therefore Curly will not pass the final. If you don’t do the homework, you won’t pass the final. Moe did the homework. Therefore Moe passed the final.

Suppose that: • variable X can represent any creature, • the predicate tove(X) is true if and only if X is a tove, • the predicate slithy(X) is true if and only if X is slithy, and • the function action(X) is a function that returns the kind of action that X is able to perform. Write a statement in predicate logic with the following meaning: "Any tove that can gyre or gimble must also be slithy." The following symbols are provided for you to copy if you wish (though not many of them are needed in this question, and you are not limited to using only the symbols that are listed here): 3 V A V ¬ A → € e ± Answer:

Describe the approach of using axiomatic semantics to prove thecorrectness of a given program.

Topic: Propositional Logic Guidelines:  - type out the work (do not handwrite)  - explain everything in words and in mathematical format - provide the solution in the format asked for the question - don't have grammar mistakes - write in full sentences

Explain axiomatic semantics and its advantages & disadvantages.

I will thumbs up if you answer all. please convert FOL to CNF  Convert each of the following English statements into a single first-order logic sentence using the following constants and predicates. •Constants: Apples, Oranges, Chess, Go, John, Mary. •Predicates: oLikes(x,y): person x likes food y oPlays(x,y): person x plays game y a.If a personlikesApples, then they play chess. b.If a person likesOranges, then they play Go. c.A person likesApples or Oranges, but not both. d.John likes apples. e.Mary does not like anything that John likes. and then: Convert each of the first-order logic sentences in Problem 2to conjunctive normal form (CNF). There is no need to show intermediate steps. Assign each clause number: C1, C2, etc.

4. Briefly explain the difference between a singular term and a predicate.

26. Which is the correct statement(s) for Non Recursive predictive parser?S1: First(α) = {t | α => * t β for some string β } => *tβS2: Follow(X) = { a | S => * αXa β for some strings α and β } a. Both statements S1 and S2 are incorrect b. S1 is incorrect and S2 is correct c. S1 is correct and S2 is incorrect d. Both statements S1 and S2 are correct