Robert S. Lubarsky

From MaRDI portal
(Redirected from Person:408536)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Inner and Outer Models for Constructive Set Theories
Handbook of Constructive Mathematics
2023-08-11Paper
On the necessity of some topological spaces2022-12-07Paper
Feedback hyperjump
Journal Of Logic And Computation
2022-02-08Paper
Notions of Cauchyness and metastability
Journal Of Logic And Computation
2020-12-15Paper
Feedback hyperjump2020-05-06Paper
An introduction to feedback Turing computability
Journal Of Logic And Computation
2020-04-29Paper
Separating the fan theorem and its weakenings. II
Journal of Symbolic Logic
2020-01-10Paper
Feedback computability on Cantor space
(available as arXiv preprint)
2019-05-17Paper
Feedback Turing computability, and Turing computability as feedback
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
2018-04-23Paper
Notions of Cauchyness and metastability2018-04-06Paper
Separating the fan theorem and its weakenings. II2018-04-06Paper
Feedback computability on Cantor space
(available as arXiv preprint)
2017-08-03Paper
Parallel feedback Turing computability
Logical Foundations of Computer Science
2017-07-21Paper
Separating fragments of WLEM, LPO, and MP
Journal of Symbolic Logic
2017-04-28Paper
Elementary epimorphisms between models of set theory
Archive for Mathematical Logic
2017-02-02Paper
Separating the fan theorem and its weakenings
Lecture Notes in Computer Science
2015-12-11Paper
Well-founded Iterations of Infinite Time Turing Machines2015-10-02Paper
On extensions of supercompactness
Mathematical Logic Quarterly
2015-06-22Paper
Separating the fan theorem and its weakenings
The Journal of Symbolic Logic
2014-12-05Paper
Walker's Cancellation Theorem
Communications in Algebra
2014-05-02Paper
Principles weaker than BD-N
The Journal of Symbolic Logic
2014-01-07Paper
Principles weaker than BD-N
The Journal of Symbolic Logic
2014-01-07Paper
Realizability Models Separating Various Fan Theorems
Lecture Notes in Computer Science
2013-08-05Paper
On the Cauchy completeness of the constructive Cauchy reals
Electronic Notes in Theoretical Computer Science
2013-05-10Paper
On the failure of BD-ℕ and BD, and an application to the anti-specker property
Journal of Symbolic Logic
2013-04-23Paper
On the failure of BD-ℕ and BD, and an application to the anti-specker property
Journal of Symbolic Logic
2013-04-23Paper
Signed-bit representations of real numbers
Journal of Logic and Analysis
2012-12-17Paper
Geometric spaces with no points
Journal of Logic and Analysis
2012-12-17Paper
The Kripke schema in metric topology
Mathematical Logic Quarterly
2012-12-10Paper
Topological forcing semantics with settling
Annals of Pure and Applied Logic
2012-04-10Paper
ITTMs with feedback2011-03-09Paper
Zero sets of univariate polynomials
Transactions of the American Mathematical Society
2011-01-06Paper
Topological forcing semantics with settling
Lecture Notes in Computer Science
2009-02-24Paper
On the constructive Dedekind reals
Logic and Analysis
2009-02-11Paper
On the Constructive Dedekind Reals: Extended Abstract
Logical Foundations of Computer Science
2008-01-04Paper
On the Cauchy completeness of the constructive Cauchy reals
Mathematical Logic Quarterly
2007-09-17Paper
CZF and second order arithmetic
Annals of Pure and Applied Logic
2006-08-16Paper
Independence results around constructive ZF
Annals of Pure and Applied Logic
2005-02-23Paper
IKP and friends
Journal of Symbolic Logic
2004-03-01Paper
On the regular extension axiom and its variants
MLQ
2003-11-10Paper
scientific article; zbMATH DE number 749933 (Why is no real title available?)1995-05-01Paper
μ-definable sets of integers
Journal of Symbolic Logic
1993-08-17Paper
An introduction to γ-recursion theory (or what to do in KP – Foundation)
Journal of Symbolic Logic
1990-01-01Paper
scientific article; zbMATH DE number 4187792 (Why is no real title available?)1989-01-01Paper
Sacks forcing sometimes needs help to produce a minimal upper bound
Journal of Symbolic Logic
1989-01-01Paper
There's No Forcing a Least Upper Bound
Proceedings of the American Mathematical Society
1989-01-01Paper
Admissibility spectra and minimality
Annals of Pure and Applied Logic
1988-01-01Paper
Another extension of Van de Wiele's theorem
Annals of Pure and Applied Logic
1988-01-01Paper
Playing with admissibility spectra
Israel Journal of Mathematics
1988-01-01Paper
Correction to “Simple r. e. degree structures”
Journal of Symbolic Logic
1988-01-01Paper
Simple r. e. degree structures
Journal of Symbolic Logic
1987-01-01Paper
Lattices of c-degrees
Annals of Pure and Applied Logic
1987-01-01Paper
Admissibility spectra through \(\omega _ 1\)
Israel Journal of Mathematics
1987-01-01Paper
Uncountable master codes and the jump hierarchy
Journal of Symbolic Logic
1987-01-01Paper


Research outcomes over time


This page was built for person: Robert S. Lubarsky