How can I prove that any finite Boolean algebra is complete?
-2
There is only the statement that any finite Boolean algebra is complete, but no rigorous proof is presented anywhere. Could you help please?
discrete-mathematics boolean-algebra
asked Nov 23 at 14:13
Amalma
1
add a comment |
-2
There is only the statement that any finite Boolean algebra is complete, but no rigorous proof is presented anywhere. Could you help please?
discrete-mathematics boolean-algebra
asked Nov 23 at 14:13
Amalma
1
Use the definition. Any finite subset has joins and meets..
– Berci
Nov 23 at 14:16
Start by defining what a "finite Boolean algebra" is, and please edit your post to include the definition you've learned in the body of the post. As is, without adding more information, including what I suggest, your question is very poor and will likely be closed.
– amWhy
Nov 23 at 14:16
inf {a,b,c} = inf {inf {a,b}, c} for example.
– William Elliot
Nov 24 at 4:38
add a comment |
-2
-2
-2
There is only the statement that any finite Boolean algebra is complete, but no rigorous proof is presented anywhere. Could you help please?
discrete-mathematics boolean-algebra
asked Nov 23 at 14:13
Amalma
1
There is only the statement that any finite Boolean algebra is complete, but no rigorous proof is presented anywhere. Could you help please?
discrete-mathematics boolean-algebra
discrete-mathematics boolean-algebra
asked Nov 23 at 14:13
Amalma
1
asked Nov 23 at 14:13
Amalma
1
asked Nov 23 at 14:13
Amalma
1
asked Nov 23 at 14:13
Amalma
1
asked Nov 23 at 14:13
Amalma
1
1
Use the definition. Any finite subset has joins and meets..
– Berci
Nov 23 at 14:16
Start by defining what a "finite Boolean algebra" is, and please edit your post to include the definition you've learned in the body of the post. As is, without adding more information, including what I suggest, your question is very poor and will likely be closed.
– amWhy
Nov 23 at 14:16
inf {a,b,c} = inf {inf {a,b}, c} for example.
– William Elliot
Nov 24 at 4:38
add a comment |
Use the definition. Any finite subset has joins and meets..
– Berci
Nov 23 at 14:16
Start by defining what a "finite Boolean algebra" is, and please edit your post to include the definition you've learned in the body of the post. As is, without adding more information, including what I suggest, your question is very poor and will likely be closed.
– amWhy
Nov 23 at 14:16
inf {a,b,c} = inf {inf {a,b}, c} for example.
– William Elliot
Nov 24 at 4:38
Use the definition. Any finite subset has joins and meets..
– Berci
Nov 23 at 14:16
Use the definition. Any finite subset has joins and meets..
– Berci
Nov 23 at 14:16
Start by defining what a "finite Boolean algebra" is, and please edit your post to include the definition you've learned in the body of the post. As is, without adding more information, including what I suggest, your question is very poor and will likely be closed.
– amWhy
Nov 23 at 14:16
Start by defining what a "finite Boolean algebra" is, and please edit your post to include the definition you've learned in the body of the post. As is, without adding more information, including what I suggest, your question is very poor and will likely be closed.
– amWhy
Nov 23 at 14:16
inf {a,b,c} = inf {inf {a,b}, c} for example.
– William Elliot
Nov 24 at 4:38
inf {a,b,c} = inf {inf {a,b}, c} for example.
– William Elliot
Nov 24 at 4:38
add a comment |
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%2f3010411%2fhow-can-i-prove-that-any-finite-boolean-algebra-is-complete%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
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.
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.
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%2f3010411%2fhow-can-i-prove-that-any-finite-boolean-algebra-is-complete%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
Use the definition. Any finite subset has joins and meets..
– Berci
Nov 23 at 14:16
Start by defining what a "finite Boolean algebra" is, and please edit your post to include the definition you've learned in the body of the post. As is, without adding more information, including what I suggest, your question is very poor and will likely be closed.
– amWhy
Nov 23 at 14:16
inf {a,b,c} = inf {inf {a,b}, c} for example.
– William Elliot
Nov 24 at 4:38