What is the reason for the specific assumption on the nature of the variables?
up vote
0
down vote
favorite
In Angelo Margaris's book First Order Mathematical Logic we have the following theorem (see pp. 84),
The equivalence theorem. Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$. Then, $$⊢∀v_1…∀v_k(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$
My questions
What is(are) the reason(s) for including "Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$.." in the statement of the result?
What would be the problem(s) in the following claim,
Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Then, $$⊢∀w(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$for any variable $w$.
Is this claim wrong? Can anyone give me an example?
One answer to the first question obviously is to go through the proof of the theorem and see whether they use the assumption anywhere in the proof. Well, in the proof the assumption is used only to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$ if $P_U$ is of the form $forall v Q_U$. Is this the only way to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$?
first-order-logic predicate-logic quantifiers
add a comment |
up vote
0
down vote
favorite
In Angelo Margaris's book First Order Mathematical Logic we have the following theorem (see pp. 84),
The equivalence theorem. Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$. Then, $$⊢∀v_1…∀v_k(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$
My questions
What is(are) the reason(s) for including "Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$.." in the statement of the result?
What would be the problem(s) in the following claim,
Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Then, $$⊢∀w(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$for any variable $w$.
Is this claim wrong? Can anyone give me an example?
One answer to the first question obviously is to go through the proof of the theorem and see whether they use the assumption anywhere in the proof. Well, in the proof the assumption is used only to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$ if $P_U$ is of the form $forall v Q_U$. Is this the only way to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$?
first-order-logic predicate-logic quantifiers
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
In Angelo Margaris's book First Order Mathematical Logic we have the following theorem (see pp. 84),
The equivalence theorem. Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$. Then, $$⊢∀v_1…∀v_k(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$
My questions
What is(are) the reason(s) for including "Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$.." in the statement of the result?
What would be the problem(s) in the following claim,
Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Then, $$⊢∀w(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$for any variable $w$.
Is this claim wrong? Can anyone give me an example?
One answer to the first question obviously is to go through the proof of the theorem and see whether they use the assumption anywhere in the proof. Well, in the proof the assumption is used only to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$ if $P_U$ is of the form $forall v Q_U$. Is this the only way to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$?
first-order-logic predicate-logic quantifiers
In Angelo Margaris's book First Order Mathematical Logic we have the following theorem (see pp. 84),
The equivalence theorem. Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$. Then, $$⊢∀v_1…∀v_k(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$
My questions
What is(are) the reason(s) for including "Let every variable that is free in $U$ or $V$ and bound in $P_U$ be in the list $v_1,…,v_k$.." in the statement of the result?
What would be the problem(s) in the following claim,
Let $U$ and $V$ be two formulas (of First Order Predicate Calculus). Let $P_U$ be a formula in which $U$ occurs as a subformula. Let $P_V$ denote the result of replacing some occurrences of $U$ by $V$. Then, $$⊢∀w(Uleftrightarrow V)→(P_Uleftrightarrow P_V)$$for any variable $w$.
Is this claim wrong? Can anyone give me an example?
One answer to the first question obviously is to go through the proof of the theorem and see whether they use the assumption anywhere in the proof. Well, in the proof the assumption is used only to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$ if $P_U$ is of the form $forall v Q_U$. Is this the only way to prove that $v$ is bound in $∀v_1…∀v_k(Uleftrightarrow V)$?
first-order-logic predicate-logic quantifiers
first-order-logic predicate-logic quantifiers
edited Nov 25 at 4:07
asked Nov 24 at 14:52
user 170039
10.4k42463
10.4k42463
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
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
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3011643%2fwhat-is-the-reason-for-the-specific-assumption-on-the-nature-of-the-variables%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
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
Required, but never shown
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
Required, but never shown
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
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown