5,544 research outputs found
Derived rules for predicative set theory: an application of sheaves
We show how one may establish proof-theoretic results for constructive
Zermelo-Fraenkel set theory, such as the compactness rule for Cantor space and
the Bar Induction rule for Baire space, by constructing sheaf models and using
their preservation properties
Pincherle's theorem in Reverse Mathematics and computability theory
We study the logical and computational properties of basic theorems of
uncountable mathematics, in particular Pincherle's theorem, published in 1882.
This theorem states that a locally bounded function is bounded on certain
domains, i.e. one of the first 'local-to-global' principles. It is well-known
that such principles in analysis are intimately connected to (open-cover)
compactness, but we nonetheless exhibit fundamental differences between
compactness and Pincherle's theorem. For instance, the main question of Reverse
Mathematics, namely which set existence axioms are necessary to prove
Pincherle's theorem, does not have an unique or unambiguous answer, in contrast
to compactness. We establish similar differences for the computational
properties of compactness and Pincherle's theorem. We establish the same
differences for other local-to-global principles, even going back to
Weierstrass. We also greatly sharpen the known computational power of
compactness, for the most shared with Pincherle's theorem however. Finally,
countable choice plays an important role in the previous, we therefore study
this axiom together with the intimately related Lindel\"of lemma.Comment: 43 pages, one appendix, to appear in Annals of Pure and Applied Logi
Duality and canonical extensions for stably compact spaces
We construct a canonical extension for strong proximity lattices in order to
give an algebraic, point-free description of a finitary duality for stably
compact spaces. In this setting not only morphisms, but also objects may have
distinct pi- and sigma-extensions.Comment: 29 pages, 1 figur
- …