Cyclic pre-proofs can be represented as sets of finite tree derivations with back-links. In the frame of the first-order logic with inductive definitions. the nodes of the tree derivations are labelled by sequents and the back-links connect particular terminal nodes. referred to as buds. https://wholesfoodsboxs.shop/product-category/flapjacks/