On the Bourbaki–Witt principle in toposes

@article{Bauer2013OnTB,
title={On the Bourbaki–Witt principle in toposes},
author={A. Bauer and Peter LeFanu Lumsdaine},
journal={Mathematical Proceedings of the Cambridge Philosophical Society},
year={2013},
volume={155},
pages={87 - 99}
}
• Published 1 January 2012
• Mathematics
• Mathematical Proceedings of the Cambridge Philosophical Society
Abstract The Bourbaki–Witt principle states that any progressive map on a chain-complete poset has a fixed point above every point. It is provable classically, but not intuitionistically. We study this and related principles in an intuitionistic setting. Among other things, we show that Bourbaki–Witt fails exactly when the trichotomous ordinals form a set, but does not imply that fixed points can always be found by transfinite iteration. Meanwhile, on the side of models, we see that the… Expand
11 Citations
Fixed-point Elimination in the Intuitionistic Propositional Calculus
• Mathematics, Computer Science
• ACM Trans. Comput. Log.
• 2020
This article gives an axiomatization of least and greatest fixed-points of formulas, and an algorithm to compute a fixed-point free formula equivalent to a given μ-formula, and shows how to compute upper bounds for closure ordinals of arbitrary intuitionistic formulas. Expand
Fixed-Point Elimination in the Intuitionistic Propositional Calculus
• Mathematics, Computer Science
• FoSSaCS
• 2016
This paper gives an axiomatization of least and greatest fixed-points of formulas, and an algorithm to compute a fixed-point free formula equivalent to a given $\mu$-formula. Expand
Transfinite Constructions in Classical Type Theory
• Mathematics, Computer Science
• ITP
• 2015
Type-theoretic versions of the theorems of Zermelo (well-orderings), Hausdorff (maximal chains), and Bourbaki and Witt (fixed points) are obtained. Expand
Using the internal language of toposes in algebraic geometry
Any scheme has its associated little and big Zariski toposes. These toposes support an internal mathematical language which closely resembles the usual formal language of mathematics, but is “localExpand
Scientific Report on the Exchange Visit Grant “Constructive Set-Theoretic Foundations: Induction in Algebra” by the ESF Research Networking Programme INFTY
• 2012
1. With Simon Huber from Chalmers (who was visiting Stockholm during my own visit) we have studied—upon suggestion by Palmgren—the relationship of the so-called BourbakiWitt Principle with OpenExpand
Scalar and Vectorial mu-calculus with Atoms
• Mathematics, Computer Science
• Log. Methods Comput. Sci.
• 2019
An extension of modal $\mu$-calculus to sets with atoms is studied and model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. Expand
SCALAR AND VECTORIAL μ-CALCULUS WITH ATOMS†
• 2019
We study an extension of modal μ-calculus to sets with atoms and we study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. OnExpand
Tower Induction and Up-to Techniques for CCS with Fixed Points
• Mathematics, Computer Science
• RAMiCS
• 2017
A refinement of Pous’ companion-based coinductive proof technique is presented and it is shown that relative bisimilarity is a congruence, a basic result implying soundness of bisimulation up to context. Expand
Engineering formal systems in constructive type theory
This thesis presents a practical methodology for formalizing the meta-theory of formal systems with binders and coinductive relations in constructive type theory based on an inductive tower construction, which is a type-theoretic form of transfinite induction. Expand
An Initial Algebra Theorem Without Iteration
• Computer Science, Mathematics
• ArXiv
• 2021
A constructive proof of the Initial Algebra Theorem that avoids transfinite iteration of the functor and equivalently obtain convergence of the initial-algebra chain as an equivalent condition, overall yielding a streamlined version of the original proof. Expand

References

SHOWING 1-10 OF 26 REFERENCES
On the Failure of Fixed-Point Theorems for Chain-complete Lattices in the Effective Topos
• A. Bauer
• Computer Science, Mathematics
• MFPS
• 2009
In the effective topos there exists a chain-complete distributive lattice with a monotone and progressive endomap which does not have a fixed point. Consequently, the Bourbaki-Witt theorem andExpand
Intuitionistic Sets and Ordinals
• P. Taylor
• Computer Science, Mathematics
• J. Symb. Log.
• 1996
It is shown how to make the successor monotone by introducing plumpness , which strengthens transitivity, and clarifies the traditional development of successors and unions, making it intuitionistic ; even the (classical) proof of trichotomy is made simpler. Expand
Sheaves in geometry and logic: a first introduction to topos theory
• Mathematics
• 1992
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 variousExpand
A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS
1. A lattice-theoretical fixpoint theorem. In this section we formulate and prove an elementary fixpoint theorem which holds in arbitrary complete lattices. In the following sections we give variousExpand
Theory of Recursive Functions and Effective Computability
If searching for the ebook by Hartley Rogers Theory of Recursive Functions and Effective Computability in pdf format, then you've come to the faithful site. We presented the complete version of thisExpand
Introduction to higher order categorical logic
• Mathematics
• 1986
Preface Part I. Introduction to Category Theory: Part II. Cartesian Closed Categories and Calculus: Part III. Type Theory and Toposes: Part IV. Representing Numerical Functions in Various CategoriesExpand
Notes on constructive set theory
• Mathematics
• 1997
4 Operations on Sets and Classes 25 4.1 Class Notation . . . . . . . . . . . . . . . . . . . . . . . . . . 25 4.2 Class Relations and Functions . . . . . . . . . . . . . . . . . . 26 4.3 SomeExpand
Realizability: An Introduction to its Categorical Side
Cellular Organization and Synaptic Circuitry: Cellular organization of the vertebrate retina, H. Kolb, R. Nelson, P. Ahnelt, N. Cuenca Comparative anatomy of major retinal pathways in the eyes of nocturnal and diurnal mammals, and Neurotransmission and Neuromodulation: Pre- and post-synaptic mechanisms of spontaneous, excitatory post- Synaptic currents in the salamander retina. Expand
Graduate Texts in Mathematics
• Mathematics
• 1982
Graduate Texts in Mathematics bridge the gap between passive study and creative understanding, offering graduate-level introductions to advanced topics in mathematics. The volumes are carefullyExpand
Suprema of families of closure operators. Seminar for foundations of mathematics and theoretical computer
• Faculty of Mathematics and Physics,
• 2008