1 problem
- 0 votes0 replies1 view
The substitution lemma for Scott complexity of finite-rank trees
Let . Write for the canonical tree of rank , and let be the tree obtained by deleting all but of the level-one subtrees o…
The substitution lemma for Scott complexity of finite-rank trees
Let . Write for the canonical tree of rank , and let be the tree obtained by deleting all but of the level-one subtrees o…