Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with trees
Search options not deleted
user 1631
A tree is a connected graph without cycles, with a finite or infinite number of vertices. There are many variants of trees, according to further constraints or decorations.
5
votes
Accepted
What is the precise relationship between "prodsimplicial sets" and rooted trees?
X : \mathrm{Prism} \vdash C X : \mathrm{Prism} $
$ l : \mathrm{list}\ \mathrm{Prism} \vdash \Pi l : \mathrm{Prism} $
There are a short list of operations needed to generate the family of rooted trees … But if that worries you, you can argue that the strange plurality of trees is isomorphic to the strange plurality of products in a natural way. And that should be enough. …
- 1,987