pith. sign in

arxiv: 1702.01556 · v1 · pith:5MSWFZMPnew · submitted 2017-02-06 · 🧮 math.LO

Some Brouwerian Counterexamples Regarding Nominal Sets in Constructive Set Theory

classification 🧮 math.LO
keywords finiteleastnominalsetssupportbrouwerianconstructivelycounterexamples
0
0 comments X
read the original abstract

The existence of least finite support is used throughout the subject of nominal sets. In this paper we give some Brouwerian counterexamples showing that constructively, least finite support does not always exist and in fact can be quite badly behaved. On this basis we reinforce the point that when working constructively with nominal sets the use of least finite support should be avoided. Moreover our examples suggest that this problem can't be fixed by requiring nominal sets to have least finite support by definition or by using the notion of subfinite instead of finite.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.