The task of mathematical logic (theorem on unambiguity of expression analysis)
0
$begingroup$
Suppose that in some signature among the functional symbols there are symbols of logical operations. within the terms used Polish notation, but in all the formula - standard infix. Will the theorem on the uniqueness of the analysis be fulfilled (theorem on unambiguity of expression analysis)?
logic propositional-calculus
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
$endgroup$
add a comment |
0
$begingroup$
Suppose that in some signature among the functional symbols there are symbols of logical operations. within the terms used Polish notation, but in all the formula - standard infix. Will the theorem on the uniqueness of the analysis be fulfilled (theorem on unambiguity of expression analysis)?
logic propositional-calculus
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
$endgroup$
1
$begingroup$
I don't quite understand what you're talking about; do you mean expressions like "$forall x(fgx=hxvee neg fx=gx)$" ($f,g,h$ function symbols)?
$endgroup$
– Noah Schweber
Dec 13 '18 at 17:07
$begingroup$
Yes, but in terms - Poland notations. For example, ∀x( A(∨ ^ a b ¬c) ∨ B(¬ ∨ a b)).
$endgroup$
– Mike Harris
Dec 13 '18 at 17:11
$begingroup$
Hello Mike, thanks for your question. I might be not able to answer your question, but in any case it may be of help to provide some more information and give maybe some background where you define your issues more mathematically or give links where this is done. Specifically concerning the theorem you care about. Cheers, Ettore
$endgroup$
– Ettore
Dec 15 '18 at 18:52
add a comment |
0
0
0
1
$begingroup$
Suppose that in some signature among the functional symbols there are symbols of logical operations. within the terms used Polish notation, but in all the formula - standard infix. Will the theorem on the uniqueness of the analysis be fulfilled (theorem on unambiguity of expression analysis)?
logic propositional-calculus
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
$endgroup$
Suppose that in some signature among the functional symbols there are symbols of logical operations. within the terms used Polish notation, but in all the formula - standard infix. Will the theorem on the uniqueness of the analysis be fulfilled (theorem on unambiguity of expression analysis)?
logic propositional-calculus
logic propositional-calculus
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
asked Dec 13 '18 at 16:51
Mike HarrisMike Harris
1
1
1
$begingroup$
I don't quite understand what you're talking about; do you mean expressions like "$forall x(fgx=hxvee neg fx=gx)$" ($f,g,h$ function symbols)?
$endgroup$
– Noah Schweber
Dec 13 '18 at 17:07
$begingroup$
Yes, but in terms - Poland notations. For example, ∀x( A(∨ ^ a b ¬c) ∨ B(¬ ∨ a b)).
$endgroup$
– Mike Harris
Dec 13 '18 at 17:11
$begingroup$
Hello Mike, thanks for your question. I might be not able to answer your question, but in any case it may be of help to provide some more information and give maybe some background where you define your issues more mathematically or give links where this is done. Specifically concerning the theorem you care about. Cheers, Ettore
$endgroup$
– Ettore
Dec 15 '18 at 18:52
add a comment |
1
$begingroup$
I don't quite understand what you're talking about; do you mean expressions like "$forall x(fgx=hxvee neg fx=gx)$" ($f,g,h$ function symbols)?
$endgroup$
– Noah Schweber
Dec 13 '18 at 17:07
$begingroup$
Yes, but in terms - Poland notations. For example, ∀x( A(∨ ^ a b ¬c) ∨ B(¬ ∨ a b)).
$endgroup$
– Mike Harris
Dec 13 '18 at 17:11
$begingroup$
Hello Mike, thanks for your question. I might be not able to answer your question, but in any case it may be of help to provide some more information and give maybe some background where you define your issues more mathematically or give links where this is done. Specifically concerning the theorem you care about. Cheers, Ettore
$endgroup$
– Ettore
Dec 15 '18 at 18:52
1
1
$begingroup$
I don't quite understand what you're talking about; do you mean expressions like "$forall x(fgx=hxvee neg fx=gx)$" ($f,g,h$ function symbols)?
$endgroup$
– Noah Schweber
Dec 13 '18 at 17:07
$begingroup$
I don't quite understand what you're talking about; do you mean expressions like "$forall x(fgx=hxvee neg fx=gx)$" ($f,g,h$ function symbols)?
$endgroup$
– Noah Schweber
Dec 13 '18 at 17:07
$begingroup$
Yes, but in terms - Poland notations. For example, ∀x( A(∨ ^ a b ¬c) ∨ B(¬ ∨ a b)).
$endgroup$
– Mike Harris
Dec 13 '18 at 17:11
$begingroup$
Yes, but in terms - Poland notations. For example, ∀x( A(∨ ^ a b ¬c) ∨ B(¬ ∨ a b)).
$endgroup$
– Mike Harris
Dec 13 '18 at 17:11
$begingroup$
Hello Mike, thanks for your question. I might be not able to answer your question, but in any case it may be of help to provide some more information and give maybe some background where you define your issues more mathematically or give links where this is done. Specifically concerning the theorem you care about. Cheers, Ettore
$endgroup$
– Ettore
Dec 15 '18 at 18:52
$begingroup$
Hello Mike, thanks for your question. I might be not able to answer your question, but in any case it may be of help to provide some more information and give maybe some background where you define your issues more mathematically or give links where this is done. Specifically concerning the theorem you care about. Cheers, Ettore
$endgroup$
– Ettore
Dec 15 '18 at 18:52
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
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%2f3038275%2fthe-task-of-mathematical-logic-theorem-on-unambiguity-of-expression-analysis%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
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.
draft saved
draft discarded
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%2f3038275%2fthe-task-of-mathematical-logic-theorem-on-unambiguity-of-expression-analysis%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
1
$begingroup$
I don't quite understand what you're talking about; do you mean expressions like "$forall x(fgx=hxvee neg fx=gx)$" ($f,g,h$ function symbols)?
$endgroup$
– Noah Schweber
Dec 13 '18 at 17:07
$begingroup$
Yes, but in terms - Poland notations. For example, ∀x( A(∨ ^ a b ¬c) ∨ B(¬ ∨ a b)).
$endgroup$
– Mike Harris
Dec 13 '18 at 17:11
$begingroup$
Hello Mike, thanks for your question. I might be not able to answer your question, but in any case it may be of help to provide some more information and give maybe some background where you define your issues more mathematically or give links where this is done. Specifically concerning the theorem you care about. Cheers, Ettore
$endgroup$
– Ettore
Dec 15 '18 at 18:52