Scribd Logo
Upload

Welcome to Scribd!

  • Formal Methods in Software Engineering Assignment#1: Marks: 100 Due Date: 7 March, 13

    Uploaded by

    salman_1084
    6 views2 pages
    This document outlines the topics and questions for a formal methods in software engineering assignment. It includes definitions of key formal methods terms, constructing truth tables for predicates, showing that certain predicates are tautologies, comparing truth tables of predicates, and formalizing natural language statements using predicates, quantifiers, and logic symbols. Students are asked to define 14 formal methods terms, construct and compare truth tables, show predicates are tautologies, formalize 6 statements, and prove a rule about universal quantifiers distributing through conjunction.

    Original Description:

    lolz

    Original Title

    Assignment1.docx

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the topics and questions for a formal methods in software engineering assignment. It includes definitions of key formal methods terms, constructing truth tables for predicates, showing that certain predicates are tautologies, comparing truth tables of predicates, and formalizing natural language statements using predicates, quantifiers, and logic symbols. Students are asked to define 14 formal methods terms, construct and compare truth tables, show predicates are tautologies, formalize 6 statements, and prove a rule about universal quantifiers distributing through conjunction.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views2 pages

    Formal Methods in Software Engineering Assignment#1: Marks: 100 Due Date: 7 March, 13

    Uploaded by

    salman_1084
    This document outlines the topics and questions for a formal methods in software engineering assignment. It includes definitions of key formal methods terms, constructing truth tables for predicates, showing that certain predicates are tautologies, comparing truth tables of predicates, and formalizing natural language statements using predicates, quantifiers, and logic symbols. Students are asked to define 14 formal methods terms, construct and compare truth tables, show predicates are tautologies, formalize 6 statements, and prove a rule about universal quantifiers distributing through conjunction.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    Formal Methods in software Engineering Assignment#1

    Marks: 100 Due date: 7 march, 13 Q1. Define the following terms. provide the examples, where needed. 1. Formal methods 2. Propositional logic 3. Conjunction 4. Disjunctions 5. Implication 6. Equivalence 7. Negation 8. Tautologies 9. Contradictions 10.Predicate 11.Bound variable 12.Range variable 13.Existential Quantifier 14.Universal Quantifier 15.Substitution Q2: Construct the truth table for the following predicates. a. P^ (!Q) b. ((P=>Q)^(Q=>R)) Q3: Show that following predicates are tautologies: a. ((p=>q)^(q=>r)^(p=>r)) b. (p=>(q=>(p ^ q))) Q4: Show that p=>q and !q => !p have the same truth table. (10) (10) (10) (30)

    Q5. Formalize the following statements

    (30)

    a. There is a natural number less than or equal to ten whose square is sixty four. b. Every natural number less than or equal to ten has a square less than or equal to one hundred. c. All Muslims must say prayer. d. One of my friends told me its sale on metro. e. Some people prefer to use formal methods for software development. f. Nobody knows the trouble I seen. Q6. Prove that, The universal quantifier distributes through conjunction. (10)

    You might also like