activity
20112017
most citedClassical consequences of continuous choice principles from intuitionistic analysis

19 citations · 28 across the 9 of their papers we have counts for

collaborators
Showing math.LOShow all

9 papers · 1 filter

math.LO2017

When does every definable nonempty set have a definable element?

François G. Dorais, Joel David Hamkins

The assertion that every definable set has a definable element is equivalent over ZF to the principle , and indeed, we prove, so is the assertion merely that every $Π…

math.LO2016

Bounding 2D Functions by Products of 1D Functions

François Dorais, Dan Hathaway

Given sets and a regular cardinal , let be the statement that for any function , there are functions and s…

math.LO2014

Comparing the strength of diagonally non-recursive functions in the absence of induction

François G. Dorais, Jeffry L. Hirst, Paul Shafer

We prove that the statement "there is a such that for every there is a -bounded diagonally non-recursive function relative to " does not imply weak König's lemma over…

math.LO2012

Reverse Mathematics and Algebraic Field Extensions

François G. Dorais, Jeffry Hirst, Paul Shafer

This paper analyzes theorems about algebraic field extensions using the techniques of reverse mathematics. In section 2, we show that is equivalent to the ability…

math.LO2012★ 19 cited

Classical consequences of continuous choice principles from intuitionistic analysis

François G. Dorais

The sequential form of a statement is the statement . There are man…

math.LO2012★ 3 cited

Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable

François G. Dorais, Steven Gubkin, Daniel McDonald +1

We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a s…

math.LO2011

On the indecomposability of

Jared R. Corduan, François G. Dorais

We study the reverse mathematics of pigeonhole principles for finite powers of the ordinal . Four natural formulations are presented and their relative strengths are compared. I…

math.LO2011★ 1 cited

A note on conjectures of F. Galvin and R. Rado

François G. Dorais

In 1968, Galvin conjectured that an uncountable poset is the union of countably many chains if and only if this is true for every subposet with size .…

math.LO2011★ 3 cited

A variant of Mathias forcing that preserves

François G. Dorais

We present and analyze -Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-…