Writing a haskell function

Assignment Help Theory of Computation
Reference no: EM132979922

Question: Conjunctive normal form (CNF) is an adequate representation of Boolean functions, because every Boolean function can be written as a conjunction of disjunctions or literals. The set {∧, ∨, ¬} suffices to write all possible Boolean functions, that is, that set of connectives is functionally complete. In fact, from De Morgan's laws we can conclude that {∧, ¬} is a functionally complete set of connectives, since P ∨ Q ≡ ¬(¬P ∧ ¬Q), so that disjunction can always be translated into negation and conjunction. Similarly {∨, ¬} is functionally complete.

Task. Show that {⇒, f } is functionally complete. That is, show that every propositional formula has a logically equivalent formula that uses only variables, the "if-then" connective, and the constant f (denoting "false"). We ask you to do this by writing a Haskell function that turns an arbitrary propositional formula into an equivalent one that uses only ⇒ and f (plus any parentheses or propositional letters you need).

Reference no: EM132979922

Questions Cloud

Determine whether g is valid or not : Determine whether G is valid or not. Either provide a proof that uses resolution to show validity, or else specify an interpretation that makes G false
By how much share premium would increase on February : A corporation was organized in January 2016 with authorized capital of P10 par value ordinary shares. By how much share premium would increase on February
Implement haskell function to encode the logical constraints : Implement a Haskell function to encode the logical constraints implied by an equality logic formula's connectives as a formula in propositional logic
Design a circuit that is not minimal for a given function : Design such a circuit, using as few gates as possible. You can define any number of sub-circuits to help you reduce the gate count (simply give each a name)
Writing a haskell function : Writing a Haskell function that turns an arbitrary propositional formula into an equivalent one that uses only ? and f (plus any parentheses or propositional
Understanding of propositional logic : Understanding of propositional logic and first-order predicate logic, including their use in mechanised reasoning - Capture, as a single propositional formula
What is the asset turnover for the company : What is the Asset turnover for the company? Calculate the profit margin ratio of the company and comment on the profitability performance of the company.
COMP30026 Models of Computation Assignment : COMP30026 Models of Computation Assignment Help and Solution, University of Melbourne - Assessment Writing Service
What is the labor portion of the bid : A product has an average labor cost of $45/hr. If you include a 50% profit margin over your costs, what is the labor portion of the bid

Reviews

Write a Review

Theory of Computation Questions & Answers

  Finite-state machine design

Create a finite-state machine design to turn your FPGA development board into a simple programmable music box.

  Redundant sequence identi cation

Redundant sequence identi cation

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Propositional and predicate logic

Write down a structural induction principle for the PlayTree free type

  Design a syntactic analyzer

Design a syntactic analyzer for the language specified by the grammar

  Design unambiguous grammar to parse expressions

Write a program would read two numbers and then print all numbers between the first and the second, inclusive. Design unambiguous grammar to parse expressions

  Consider a logic function with three outputs

Consider a logic function with three outputs,  A ,  B , and  C , and three inputs,  D ,  E , and  F . The function is defined as follows:  A  is true if at least one input is true,  B  is true

  Considering a single programmed operating system

Considering a single programmed operating system, what is the minimal total time required to complete executions of the two processes? You should explain your answer with a diagram.

  How to construct an nfa

Give a construction that assumes you are given a DFA for L and show how to construct an NFA (with or without ε-moves) to recognize sort(L).

  Equivalence classes to construct minimal dfa for language

How many equivalence classes does this relation have and what are they? Use these equivalence classes to construct the minimal DFA for the language.

  Impact of moore-s law on data center costs

Discuss the impact of Moore's law on data center costs on such things as servers and communications equipment. List at least 3 steps or recommendations your data center can take to offset some or all of the effect of Moore's law.

  Problem encountered in statements in predicate logic

How the problem would be encountered in attempting to represent the following statements in Predicate logic. it should be possible to: John only likes to see French movies.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd