We stand with Ukraine  

Robert S. Lubarsky

Affiliations:
  • Florida Atlantic University, Boca Raton, FL, USA


According to our database1, Robert S. Lubarsky authored at least 40 papers between 1987 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On the Necessity of Some Topological Spaces.
[BibTeX]
[DOI]
Robert S. Lubarsky
Proceedings of the Revolutions and Revelations in Computability, 2022

2021
Feedback hyperjump.
[BibTeX]
[DOI]
Juan P. Aguilera
,
Robert S. Lubarsky
J. Log. Comput., 2021

2020
Notions of Cauchyness and metastability.
[BibTeX]
[DOI]
Hannes Diener
,
Robert S. Lubarsky
J. Log. Comput., 2020

An introduction to feedback Turing computability.
[BibTeX]
[DOI]
Nathanael L. Ackerman
,
Cameron E. Freer
,
Robert S. Lubarsky
J. Log. Comput., 2020

Feedback Hyperjump.
[BibTeX]
[DOI]
Robert S. Lubarsky
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019
Feedback computability on Cantor space.
[BibTeX]
[DOI]
Nathanael L. Ackerman
,
Cameron E. Freer
,
Robert S. Lubarsky
Log. Methods Comput. Sci., 2019

Separating the Fan Theorem and its weakenings II.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 2019

2016
Separating Fragments of Wlem, LPO, and MP.
[BibTeX]
[DOI]
Matthew Hendtlass
,
Robert S. Lubarsky
J. Symb. Log., 2016

Elementary epimorphisms between models of set theory.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Norman Lewis Perlmutter
Arch. Math. Log., 2016

Parallel Feedback Turing Computability.
[BibTeX]
[DOI]
Robert S. Lubarsky
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2015
On extensions of supercompactness.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Norman Lewis Perlmutter
Math. Log. Q., 2015

Feedback Turing Computability, and Turing Computability as Feedback.
[BibTeX]
[DOI]
Nathanael L. Ackerman
,
Cameron E. Freer
,
Robert S. Lubarsky
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Separating the Fan Theorem and its weakenings.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Hannes Diener
J. Symb. Log., 2014

2013
On the failure of BD- and BD, and an application to the anti-Specker property.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 2013

Principles weaker than BD-N.
[BibTeX]
[DOI]
Hannes Diener
,
Robert S. Lubarsky
J. Symb. Log., 2013

Walker's Cancellation Theorem.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Fred Richman
Proceedings of the TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic, Vanderbilt University, Nashville, Tennessee, USA, July 28, 2013

Realizability Models Separating Various Fan Theorems.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Michael Rathjen
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
The Kripke schema in metric topology.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Fred Richman
,
Peter Schuster
Math. Log. Q., 2012

Topological forcing semantics with settling.
[BibTeX]
[DOI]
Robert S. Lubarsky
Ann. Pure Appl. Log., 2012

2010
Addendum and Erratum to "Geometric spaces with no points".
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Log. Anal., 2010

Geometric spaces with no points.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Log. Anal., 2010

2009
Signed-bit representations of real numbers.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Fred Richman
J. Log. Anal., 2009

2008
On the constructive Dedekind reals.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Michael Rathjen
Log. Anal., 2008

2007
On the Constructive Dedekind Reals: Extended Abstract.
[BibTeX]
[DOI]
Robert S. Lubarsky
,
Michael Rathjen
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

2006
On the Cauchy Completeness of the Constructive Cauchy Reals.
[BibTeX]
[DOI]
Robert S. Lubarsky
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

CZF and Second Order Arithmetic.
[BibTeX]
[DOI]
Robert S. Lubarsky
Ann. Pure Appl. Log., 2006

2005
Independence results around constructive ZF.
[BibTeX]
[DOI]
Robert S. Lubarsky
Ann. Pure Appl. Log., 2005

2003
On the regular extension axiom and its variants.
[BibTeX]
[DOI]
Michael Rathjen
,
Robert S. Lubarsky
Math. Log. Q., 2003

2002
Ikp and Friends.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 2002

1993
µ-Definable Sets of Integers.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 1993

1990
An Introduction to gamma-Recursion Theory (Or What to Do in KP-Foundation).
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 1990

1989
Sacks Forcing Sometimes Needs Help to Produce a Minimal Upper Bound.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 1989

mu-Definable Sets of Integers
[BibTeX]
[DOI]
Robert S. Lubarsky
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1988
Definability and Initial Segments of c-Degrees.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 1988

Correction to "Simple R. E. Degree Structures".
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 1988

Another extension of Van de Wiele's theorem.
[BibTeX]
[DOI]
Robert S. Lubarsky
Ann. Pure Appl. Log., 1988

Admissibility spectra and minimality.
[BibTeX]
[DOI]
Robert S. Lubarsky
Ann. Pure Appl. Log., 1988

1987
Uncountable Master Codes and the Jump Hierarchy.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 1987

Simple R. E. Degree Structures.
[BibTeX]
[DOI]
Robert S. Lubarsky
J. Symb. Log., 1987

Lattices of c-degrees.
[BibTeX]
[DOI]
Robert S. Lubarsky
Ann. Pure Appl. Log., 1987


  Loading...