Discrete Math: How can I determine the consistency of the system?

In summary, the system specifications given are not consistent due to a contradiction between the statements p → q and ¬p → ¬q.
  • #1
agentlee
20
0

Homework Statement


Are these system specifications consistent? "Whenever the system software is being upgraded, users cannot access the file system. If users can access the file system, then they can have new files, then the system software is not being upgraded."


Homework Equations


p: The system software is being upgraded
q: Users cannot access the file system
r: users can save new files.


The Attempt at a Solution


My professor did not really explain what consistency was. So I am unsure of how to go about doing this problem. I did some searching on this same problem and found that p→⇁q

I don't quite understand why that is. Can someone please help?
 
Physics news on Phys.org
  • #2


First, let's clarify what consistency means in this context. In logic, consistency refers to the relationship between statements or propositions. A set of statements is considered consistent if they can all be true at the same time. In other words, there are no contradictions or conflicts between the statements.

Now, let's break down the system specifications given in the forum post and translate them into logical statements using the given variables.

1. Whenever the system software is being upgraded, users cannot access the file system. This can be translated as p → q. In other words, if the system software is being upgraded (p), then users cannot access the file system (q).

2. If users can access the file system, then they can have new files. This can be translated as q → r. In other words, if users can access the file system (q), then they can have new files (r).

3. If the system software is not being upgraded, then users can access the file system. This can be translated as ¬p → ¬q. In other words, if the system software is not being upgraded (¬p), then users can access the file system (¬q).

Now, let's try to determine the consistency of these statements by looking for any contradictions or conflicts between them.

First, let's consider the statements p → q and q → r. If we assume that p is true (the system software is being upgraded), then q must also be true (users cannot access the file system). This makes the statement q → r automatically true, since both q and r are true. So far, there are no contradictions or conflicts between these two statements.

Next, let's consider the statements p → q and ¬p → ¬q. If we assume that p is true (the system software is being upgraded), then q must also be true (users cannot access the file system). However, the statement ¬p → ¬q states that if p is false (the system software is not being upgraded), then q must also be false (users cannot access the file system). This contradicts our initial assumption that p is true and q is true. Therefore, these two statements are inconsistent.

In conclusion, the system specifications given in the forum post are not consistent, since there is a contradiction between p → q and ¬p → ¬q. This means that the system cannot satisfy all of these specifications at the same time.
 

1. What is discrete math and why is it important?

Discrete math is a branch of mathematics that deals with discrete structures, such as integers and graphs. It is important because it has many practical applications in computer science, cryptography, and other fields.

2. What does it mean for a system to be consistent?

A system is considered consistent if there is at least one solution that satisfies all of its equations or constraints. In other words, there are no contradictions within the system.

3. How can I determine the consistency of a system?

One way to determine the consistency of a system is by using proof techniques, such as proof by contradiction or proof by induction. Another approach is to use algebraic methods, such as Gaussian elimination, to solve the system and check for any inconsistencies.

4. Can a system be consistent but not satisfiable?

Yes, a system can be consistent but not satisfiable. This means that there are no solutions that satisfy all of the equations or constraints in the system.

5. What are the consequences of an inconsistent system?

If a system is inconsistent, it means that there are contradictions within the system and it has no solutions. This can lead to incorrect results and unreliable predictions in real-world applications.

Similar threads

  • Calculus and Beyond Homework Help
Replies
3
Views
28K
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Programming and Computer Science
Replies
11
Views
985
  • Programming and Computer Science
Replies
14
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Computing and Technology
2
Replies
37
Views
5K
  • Calculus and Beyond Homework Help
Replies
1
Views
900
  • Computing and Technology
Replies
24
Views
2K
  • MATLAB, Maple, Mathematica, LaTeX
Replies
10
Views
2K
Replies
12
Views
1K
Back
Top