Terminology about trees
$begingroup$
In set theory, a tree usually defined as a partial order such that the set of elements below any given one is well-ordered. I am interested in the class of partial orders $P$ such that for every $p in P$, the set of $q leq p$ is just linearly ordered. Does this have a name?
set-theory terminology posets trees
edited 2 hours ago
YCor
27.3k481132
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
$endgroup$
add a comment |
$begingroup$
In set theory, a tree usually defined as a partial order such that the set of elements below any given one is well-ordered. I am interested in the class of partial orders $P$ such that for every $p in P$, the set of $q leq p$ is just linearly ordered. Does this have a name?
set-theory terminology posets trees
edited 2 hours ago
YCor
27.3k481132
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
$endgroup$
add a comment |
$begingroup$
In set theory, a tree usually defined as a partial order such that the set of elements below any given one is well-ordered. I am interested in the class of partial orders $P$ such that for every $p in P$, the set of $q leq p$ is just linearly ordered. Does this have a name?
set-theory terminology posets trees
edited 2 hours ago
YCor
27.3k481132
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
$endgroup$
In set theory, a tree usually defined as a partial order such that the set of elements below any given one is well-ordered. I am interested in the class of partial orders $P$ such that for every $p in P$, the set of $q leq p$ is just linearly ordered. Does this have a name?
set-theory terminology posets trees
set-theory terminology posets trees
edited 2 hours ago
YCor
27.3k481132
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
edited 2 hours ago
YCor
27.3k481132
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
edited 2 hours ago
YCor
27.3k481132
edited 2 hours ago
YCor
27.3k481132
edited 2 hours ago
YCor
27.3k481132
27.3k481132
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
asked 2 hours ago
Monroe EskewMonroe Eskew
7,63012157
7,63012157
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
They are also called trees.
In that terminology, trees of your first kind are known as the well-founded trees, since they are trees where the tree order is well-founded (and well-founded linear orders are the same as well-orders).
I think that the situation is that because set theorists are mainly interested in the well-founded case, the terminology evolved to drop the adjective from well-founded trees.
There are many competing definitions of tree in mathematics, not all equivalent. For graph-theorists, for example, a tree is a certain kind of cycle-free graph.
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
$endgroup$
add a comment |
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: "504"
};
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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%2fmathoverflow.net%2fquestions%2f321178%2fterminology-about-trees%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
They are also called trees.
In that terminology, trees of your first kind are known as the well-founded trees, since they are trees where the tree order is well-founded (and well-founded linear orders are the same as well-orders).
I think that the situation is that because set theorists are mainly interested in the well-founded case, the terminology evolved to drop the adjective from well-founded trees.
There are many competing definitions of tree in mathematics, not all equivalent. For graph-theorists, for example, a tree is a certain kind of cycle-free graph.
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
$endgroup$
add a comment |
$begingroup$
They are also called trees.
In that terminology, trees of your first kind are known as the well-founded trees, since they are trees where the tree order is well-founded (and well-founded linear orders are the same as well-orders).
I think that the situation is that because set theorists are mainly interested in the well-founded case, the terminology evolved to drop the adjective from well-founded trees.
There are many competing definitions of tree in mathematics, not all equivalent. For graph-theorists, for example, a tree is a certain kind of cycle-free graph.
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
$endgroup$
add a comment |
$begingroup$
They are also called trees.
In that terminology, trees of your first kind are known as the well-founded trees, since they are trees where the tree order is well-founded (and well-founded linear orders are the same as well-orders).
I think that the situation is that because set theorists are mainly interested in the well-founded case, the terminology evolved to drop the adjective from well-founded trees.
There are many competing definitions of tree in mathematics, not all equivalent. For graph-theorists, for example, a tree is a certain kind of cycle-free graph.
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
$endgroup$
They are also called trees.
In that terminology, trees of your first kind are known as the well-founded trees, since they are trees where the tree order is well-founded (and well-founded linear orders are the same as well-orders).
I think that the situation is that because set theorists are mainly interested in the well-founded case, the terminology evolved to drop the adjective from well-founded trees.
There are many competing definitions of tree in mathematics, not all equivalent. For graph-theorists, for example, a tree is a certain kind of cycle-free graph.
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
answered 2 hours ago
Joel David HamkinsJoel David Hamkins
164k25502869
164k25502869
add a comment |
add a comment |
Thanks for contributing an answer to MathOverflow!
- 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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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%2fmathoverflow.net%2fquestions%2f321178%2fterminology-about-trees%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');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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');
var $window = $(window),
onScroll = function(e) {
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom)) {
StackExchange.using('gps', function() { StackExchange.gps.track('embedded_signup_form.view', { location: 'question_page' }); });
$window.unbind('scroll', onScroll);
}
};
$window.on('scroll', onScroll);
});
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
