most citedSeparating the Fan Theorem and Its Weakenings

9 citations · 18 across the 12 of their papers we have counts for

collaborators
Showing math.LOShow all

16 papers · 1 filter

math.LO2017

Feedback computability on Cantor space

Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky

We introduce the notion of feedback computable functions from to , extending feedback Turing computation in analogy with the standard notion of computability for functio…

math.LO2015

Realizability Models Separating Various Fan Theorems

Robert S. Lubarsky, Michael Rathjen

We develop a realizability model in which the realizers are the reals not just Turing computable in a fixed real but rather the reals in a countable ideal of Turing degrees. This i…

math.LO2015★ 9 cited

Separating the Fan Theorem and Its Weakenings

Robert S. Lubarsky, Hannes Diener

Varieties of the Fan Theorem have recently been developed in reverse constructive mathematics, corresponding to different continuity principles. They form a natural implicational h…

math.LO2015

Principles Weaker than BD-N

Robert S. Lubarsky, Hannes Diener

BD-N is a weak principle of constructive analysis. Several interesting principles implied by BD-N have already been identified, namely the closure of the anti-Specker spaces under…

math.LO2015★ 3 cited

Walker's cancellation theorem

Robert Lubarsky, Fred Richman

Walker's cancellation theorem says that if B+Z is isomorphic to C+Z in the category of abelian groups, then B is isomorphic to C. We construct an example in a diagram category of a…

math.LO2015★ 2 cited

On the Failure of BD-N and BD, and an Application to the Anti-Specker Property

Robert Lubarsky

We give the natural topological model for the failure of BD-N, and use it to show that the closure of spaces with the anti-Specker property under product does not imply BD-N. Also,…

math.LO2015

Geometric Spaces with No Points

Robert Lubarsky

Some models of set theory are given which contain sets that have some of the important characteristics of being geometric, or spatial, yet do not have any points, in various ways.…

math.LO2015

Zero Sets of Univariate Polynomials

Robert Lubarsky, Fred Richman

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to co…

math.LO2015

Topological Forcing Semantics with Settling

Robert Lubarsky

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued mo…

math.LO2015

Well-founded Iterations of Infinite Time Turing Machines

Robert Lubarsky

Infinite time Turing machines are extended in several ways to allow for iterated oracle calls. The expressive power of these machines is discussed and in some cases determined.

math.LO2015★ 4 cited

Signed-Bit Representations of Real Numbers

Robert Lubarsky, Fred Richman

The signed-bit representation of real numbers is like the binary representation, but in addition to 0 and 1 you can also use -1. It lends itself especially well to the constructive…

math.LO2015

On the Constructive Dedekind Reals

Robert Lubarsky, Michael Rathjen

In order to build the collection of Cauchy reals as a set in constructive set theory, the only Power Set-like principle needed is Exponentiation. In contrast, the proof that the De…

math.LO2015

On the Cauchy Completeness of the Constructive Cauchy Reals

Robert Lubarsky

It is consistent with constructive set theory (without Countable Choice, clearly) that the Cauchy reals (equivalence classes of Cauchy sequences of rationals) are not Cauchy comple…

math.LO2015

CZF and Second Order Arithmetic

Robert Lubarsky

CZF + Separation is shown to be equiconsistent with second-order arithmetic, using realizability.

math.LO2015

Independence Results around Constructive ZF

Robert Lubarsky

Using Kripke models, it is shown that CZF does not prove Power Set, and that CZF with Subset Collection substituted by Exponentiation does not prove Subset Collection.

math.LO2015

IKP and Friends

Robert Lubarsky

The basics of Intuitionistic Kripke-Platek set theory are developed, and some independence results among related classically equivalent theories are shown using Kripke models.