# Representing nested relations

**URL:** <https://community.fibery.io/t/representing-nested-relations/1405>\
**Category:** Ideas & Features\
**Created:** [February 25, 2021, 7:34pm UTC](https://community.fibery.io/t/representing-nested-relations/1405 "2021-02-25T19:34:31Z")\
**Posts on this page:** 1\
**Showing post:** 11

<div class="post-metadata">

**Author:** ![seaotternerd](https://avatars.discourse-cdn.com/v4/letter/s/b5a626/32.png) [@seaotternerd](https://community.fibery.io/u/seaotternerd)\
**Post date:** [June 2, 2021, 9:45pm UTC](https://community.fibery.io/t/representing-nested-relations/1405/11 "2021-06-02T21:45:26Z")

</div>

Am I correctly interpreting that only top-level types within a hierarchical list are allowed to be recursive? Would it be possible to allow nested types to have recursive relations as well?

I’ve got two types, **ideas** and **tasks** (it’s sort of a simplified GIST approach). Ideas can have sub-ideas and sub-tasks. Tasks can also have their own sub-tasks. Currently I’ve got a list that shows nested ideas, but I can only make it show the first level of sub-tasks.

---

_[View the full topic](https://community.fibery.io/t/representing-nested-relations/1405)._