SHEAF RECURSION AND A SEPARATION THEOREM

@article{Ackerman2014SHEAFRA,
  title={SHEAF RECURSION AND A SEPARATION THEOREM},
  author={Nathanael Leedom Ackerman},
  journal={The Journal of Symbolic Logic},
  year={2014},
  volume={79},
  pages={882 - 907}
}
  • N. Ackerman
  • Published 18 August 2014
  • Mathematics, Computer Science
  • The Journal of Symbolic Logic
Abstract Define a second order tree to be a map between trees (with fixed codomain). We show that many properties of ordinary trees have analogs for second order trees. In particular, we show that there is a notion of “definition by recursion on a well-founded second order tree” which generalizes “definition by transfinite recursion”. We then use this new notion of definition by recursion to prove an analog of Lusin’s Separation theorem for closure spaces of global sections of a second order… 

References

SHOWING 1-10 OF 29 REFERENCES
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
TLDR
This result gives a unifying and general account of most techniques used in computer science in order to ensure convergency of circular definitions, such as well-founded recursion and contractivity in complete ultra metric spaces.
The Topos of Labelled Trees: A Categorical Semantics for SCCS
TLDR
A semantics for SCCS is given using the constructions of the topos of labelled trees, including unbounded non-determinism, and a partial solution to the problem of characterizing bisimulation in terms of a class of morphisms is proposed.
Sheaves in geometry and logic: a first introduction to topos theory
This text presents topos theory as it has developed from the study of sheaves. Sheaves arose in geometry as coefficients for cohomology and as descriptions of the functions appropriate to various
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees
TLDR
It is proposed that the internal logic of S provides the right setting for the synthetic construction of abstract versions of step-indexed models of programming languages and program logics.
Descriptive Set Theory
Descriptive Set Theory is the study of sets in separable, complete metric spaces that can be defined (or constructed), and so can be expected to have special properties not enjoyed by arbitrary
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
TLDR
This paper shows that an optimized variant of Ohlebusch's unraveling for deterministic CTRSs is sound w.r.t. reduction, and shows that soundness of a transformation proposed by Sanut¸ua and Rosu for deterministically-supervised CTRs impliessoundness of Ohlbusch’s unraveling.
Admissible Sets and Structures: An Approach to Definability Theory
...
...