Soundness of a rule of a proof system with respect to the truth tables?
Clash Royale CLAN TAG#URR8PPP
up vote
5
down vote
favorite
I have the following question:
"Explain the concept of the soundness of a rule of a proof system with respect to the truth tables"
Would it be correct to state the following:
"A rule of a proof system is sound with respect to the truth tables iff the conditions of the rules (requirements of the rule) ensure that the final formula will behave according to it's intended truth table."?
This is a question in a practice exam, and I can not find a specific mentioning so far, by scanning Google and Proof Wiki.
What would the correct answer be?
Thank you.
logic propositional-calculus predicate-logic
asked Nov 2 '13 at 23:21
borg123
115210
add a comment |Â
up vote
5
down vote
favorite
I have the following question:
"Explain the concept of the soundness of a rule of a proof system with respect to the truth tables"
Would it be correct to state the following:
"A rule of a proof system is sound with respect to the truth tables iff the conditions of the rules (requirements of the rule) ensure that the final formula will behave according to it's intended truth table."?
This is a question in a practice exam, and I can not find a specific mentioning so far, by scanning Google and Proof Wiki.
What would the correct answer be?
Thank you.
logic propositional-calculus predicate-logic
asked Nov 2 '13 at 23:21
borg123
115210
Look up "soundness vs. completeness".
– dfeuer
Nov 2 '13 at 23:58
add a comment |Â
up vote
5
down vote
favorite
up vote
5
down vote
favorite
I have the following question:
"Explain the concept of the soundness of a rule of a proof system with respect to the truth tables"
Would it be correct to state the following:
"A rule of a proof system is sound with respect to the truth tables iff the conditions of the rules (requirements of the rule) ensure that the final formula will behave according to it's intended truth table."?
This is a question in a practice exam, and I can not find a specific mentioning so far, by scanning Google and Proof Wiki.
What would the correct answer be?
Thank you.
logic propositional-calculus predicate-logic
asked Nov 2 '13 at 23:21
borg123
115210
I have the following question:
"Explain the concept of the soundness of a rule of a proof system with respect to the truth tables"
Would it be correct to state the following:
"A rule of a proof system is sound with respect to the truth tables iff the conditions of the rules (requirements of the rule) ensure that the final formula will behave according to it's intended truth table."?
This is a question in a practice exam, and I can not find a specific mentioning so far, by scanning Google and Proof Wiki.
What would the correct answer be?
Thank you.
logic propositional-calculus predicate-logic
logic propositional-calculus predicate-logic
asked Nov 2 '13 at 23:21
borg123
115210
asked Nov 2 '13 at 23:21
borg123
115210
asked Nov 2 '13 at 23:21
borg123
115210
asked Nov 2 '13 at 23:21
borg123
115210
asked Nov 2 '13 at 23:21
borg123
115210
115210
Look up "soundness vs. completeness".
– dfeuer
Nov 2 '13 at 23:58
add a comment |Â
Look up "soundness vs. completeness".
– dfeuer
Nov 2 '13 at 23:58
Look up "soundness vs. completeness".
– dfeuer
Nov 2 '13 at 23:58
Look up "soundness vs. completeness".
– dfeuer
Nov 2 '13 at 23:58
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
4
down vote
Let's consider the following rule (modus ponens):
$$rmIf ~~~vdash P rightarrow Q ~~~~rmand~~~ vdash Prm, ~~~~then~~~~ vdash Q$$
To prove that it's sound with respect to truth-tables it will suffice to show that:
$$rmIf ~~~models P rightarrow Q ~~~~rmand~~~ models Prm, ~~~~then~~~~ models Q$$
Which says that every row of the truth-table that makes $(P rightarrow Q)$ and $P$ true, also makes $Q$ true.
Proof. Among the two rows that make $P$ true, only the $[P=Q=top]$-row makes $(P rightarrow Q)$ true. And since $Q$ is true on that row, we've shown that the rule is sound with respect to truth-tables.
What is true of this rule is true of the others. (In your particular context, of course.)
Note. Showing that all the rules are sound is not enough to establish the soundness of your proof system with respect to truth-tables, because you will also have to show that all the axioms of the system (say $P lor lnot P)$ are assigned the value $top$ on all rows of the truth-table.
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
4
down vote
Let's consider the following rule (modus ponens):
$$rmIf ~~~vdash P rightarrow Q ~~~~rmand~~~ vdash Prm, ~~~~then~~~~ vdash Q$$
To prove that it's sound with respect to truth-tables it will suffice to show that:
$$rmIf ~~~models P rightarrow Q ~~~~rmand~~~ models Prm, ~~~~then~~~~ models Q$$
Which says that every row of the truth-table that makes $(P rightarrow Q)$ and $P$ true, also makes $Q$ true.
Proof. Among the two rows that make $P$ true, only the $[P=Q=top]$-row makes $(P rightarrow Q)$ true. And since $Q$ is true on that row, we've shown that the rule is sound with respect to truth-tables.
What is true of this rule is true of the others. (In your particular context, of course.)
Note. Showing that all the rules are sound is not enough to establish the soundness of your proof system with respect to truth-tables, because you will also have to show that all the axioms of the system (say $P lor lnot P)$ are assigned the value $top$ on all rows of the truth-table.
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
add a comment |Â
up vote
4
down vote
Let's consider the following rule (modus ponens):
$$rmIf ~~~vdash P rightarrow Q ~~~~rmand~~~ vdash Prm, ~~~~then~~~~ vdash Q$$
To prove that it's sound with respect to truth-tables it will suffice to show that:
$$rmIf ~~~models P rightarrow Q ~~~~rmand~~~ models Prm, ~~~~then~~~~ models Q$$
Which says that every row of the truth-table that makes $(P rightarrow Q)$ and $P$ true, also makes $Q$ true.
Proof. Among the two rows that make $P$ true, only the $[P=Q=top]$-row makes $(P rightarrow Q)$ true. And since $Q$ is true on that row, we've shown that the rule is sound with respect to truth-tables.
What is true of this rule is true of the others. (In your particular context, of course.)
Note. Showing that all the rules are sound is not enough to establish the soundness of your proof system with respect to truth-tables, because you will also have to show that all the axioms of the system (say $P lor lnot P)$ are assigned the value $top$ on all rows of the truth-table.
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
add a comment |Â
up vote
4
down vote
up vote
4
down vote
Let's consider the following rule (modus ponens):
$$rmIf ~~~vdash P rightarrow Q ~~~~rmand~~~ vdash Prm, ~~~~then~~~~ vdash Q$$
To prove that it's sound with respect to truth-tables it will suffice to show that:
$$rmIf ~~~models P rightarrow Q ~~~~rmand~~~ models Prm, ~~~~then~~~~ models Q$$
Which says that every row of the truth-table that makes $(P rightarrow Q)$ and $P$ true, also makes $Q$ true.
Proof. Among the two rows that make $P$ true, only the $[P=Q=top]$-row makes $(P rightarrow Q)$ true. And since $Q$ is true on that row, we've shown that the rule is sound with respect to truth-tables.
What is true of this rule is true of the others. (In your particular context, of course.)
Note. Showing that all the rules are sound is not enough to establish the soundness of your proof system with respect to truth-tables, because you will also have to show that all the axioms of the system (say $P lor lnot P)$ are assigned the value $top$ on all rows of the truth-table.
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
Let's consider the following rule (modus ponens):
$$rmIf ~~~vdash P rightarrow Q ~~~~rmand~~~ vdash Prm, ~~~~then~~~~ vdash Q$$
To prove that it's sound with respect to truth-tables it will suffice to show that:
$$rmIf ~~~models P rightarrow Q ~~~~rmand~~~ models Prm, ~~~~then~~~~ models Q$$
Which says that every row of the truth-table that makes $(P rightarrow Q)$ and $P$ true, also makes $Q$ true.
Proof. Among the two rows that make $P$ true, only the $[P=Q=top]$-row makes $(P rightarrow Q)$ true. And since $Q$ is true on that row, we've shown that the rule is sound with respect to truth-tables.
What is true of this rule is true of the others. (In your particular context, of course.)
Note. Showing that all the rules are sound is not enough to establish the soundness of your proof system with respect to truth-tables, because you will also have to show that all the axioms of the system (say $P lor lnot P)$ are assigned the value $top$ on all rows of the truth-table.
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
edited Nov 3 '13 at 4:58
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
answered Nov 3 '13 at 3:54
Hunan Rostomyan
1,7661016
1,7661016
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f549569%2fsoundness-of-a-rule-of-a-proof-system-with-respect-to-the-truth-tables%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Look up "soundness vs. completeness".
– dfeuer
Nov 2 '13 at 23:58