Recursion Schemes and Logical Reflection
Let ℛ be a class of generators of node-labelled infinite trees, and ℒ be a logical language for describing correctness properties of these trees. Given R ∈ R and φ ∈ ℒ, we say that Rφ is a φ-reflection of R just if (i) R and Rφ generate the same underlying tree, and (ii) suppose a node u of the tree...
| Váldodahkkit: | , , , , |
|---|---|
| Materiálatiipa: | Conference item |
| Almmustuhtton: |
2010
|