default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert S. Lubarsky
Person information
- affiliation: Florida Atlantic University, Boca Raton, FL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Taras Banakh, Robert S. Lubarsky:
On the necessity of some topological spaces. Comput. 13(3-4): 223-236 (2024)- [c14]Juan P. Aguilera, Robert S. Lubarsky, Leonardo Pacheco
:
Higher-Order Feedback Computation. CiE 2024: 298-310 - 2022
- [c13]Robert S. Lubarsky:
On the Necessity of Some Topological Spaces. CiE 2022: 162-171 - 2021
- [j32]Juan P. Aguilera, Robert S. Lubarsky:
Feedback hyperjump. J. Log. Comput. 31(1): 20-39 (2021) - 2020
- [j31]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
An introduction to feedback Turing computability. J. Log. Comput. 30(1): 27-60 (2020) - [j30]Hannes Diener, Robert S. Lubarsky:
Notions of Cauchyness and metastability. J. Log. Comput. 30(8): 1487-1504 (2020) - [c12]Robert S. Lubarsky:
Feedback Hyperjump. LFCS 2020: 144-155
2010 – 2019
- 2019
- [j29]Robert S. Lubarsky:
Separating the Fan Theorem and its weakenings II. J. Symb. Log. 84(4): 1484-1509 (2019) - [j28]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback computability on Cantor space. Log. Methods Comput. Sci. 15(2) (2019) - 2018
- [c11]Hannes Diener, Robert S. Lubarsky:
Notions of Cauchyness and Metastability. LFCS 2018: 140-153 - [c10]Robert S. Lubarsky:
Separating the Fan Theorem and Its Weakenings II. LFCS 2018: 242-255 - 2017
- [i1]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback computability on Cantor space. CoRR abs/1708.01139 (2017) - 2016
- [j27]Robert S. Lubarsky, Norman Lewis Perlmutter:
Elementary epimorphisms between models of set theory. Arch. Math. Log. 55(5-6): 759-766 (2016) - [j26]Matthew Hendtlass, Robert S. Lubarsky:
Separating Fragments of Wlem, LPO, and MP. J. Symb. Log. 81(4): 1315-1343 (2016) - [c9]Robert S. Lubarsky:
Parallel Feedback Turing Computability. LFCS 2016: 236-250 - 2015
- [j25]Robert S. Lubarsky, Norman Lewis Perlmutter:
On extensions of supercompactness. Math. Log. Q. 61(3): 217-223 (2015) - [c8]Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
Feedback Turing Computability, and Turing Computability as Feedback. LICS 2015: 523-534 - 2014
- [j24]Robert S. Lubarsky, Hannes Diener:
Separating the Fan Theorem and its weakenings. J. Symb. Log. 79(3): 792-813 (2014) - 2013
- [j23]Robert S. Lubarsky:
On the failure of BD- and BD, and an application to the anti-Specker property. J. Symb. Log. 78(1): 39-56 (2013) - [j22]Hannes Diener, Robert S. Lubarsky:
Principles weaker than BD-N. J. Symb. Log. 78(3): 873-885 (2013) - [c7]Robert S. Lubarsky, Michael Rathjen:
Realizability Models Separating Various Fan Theorems. CiE 2013: 306-315 - [c6]Robert S. Lubarsky, Hannes Diener:
Separating the Fan Theorem and Its Weakenings. LFCS 2013: 280-295 - [c5]Robert S. Lubarsky, Fred Richman:
Walker's Cancellation Theorem. TACL 2013: 145-147 - 2012
- [j21]Robert S. Lubarsky:
Topological forcing semantics with settling. Ann. Pure Appl. Log. 163(7): 820-830 (2012) - [j20]Robert S. Lubarsky, Fred Richman, Peter Schuster:
The Kripke schema in metric topology. Math. Log. Q. 58(6): 498-501 (2012) - 2010
- [j19]Robert S. Lubarsky:
Geometric spaces with no points. J. Log. Anal. 2 (2010) - [j18]Robert S. Lubarsky:
Addendum and Erratum to "Geometric spaces with no points". J. Log. Anal. 2 (2010)
2000 – 2009
- 2009
- [j17]Robert S. Lubarsky, Fred Richman:
Signed-bit representations of real numbers. J. Log. Anal. 1 (2009) - [c4]Robert S. Lubarsky:
Topological Forcing Semantics with Settling. LFCS 2009: 309-322 - 2008
- [j16]Robert S. Lubarsky, Michael Rathjen:
On the constructive Dedekind reals. Log. Anal. 1(2): 131-152 (2008) - 2007
- [j15]Robert S. Lubarsky:
On the Cauchy completeness of the constructive Cauchy reals. Math. Log. Q. 53(4-5): 396-414 (2007) - [c3]Robert S. Lubarsky, Michael Rathjen:
On the Constructive Dedekind Reals: Extended Abstract. LFCS 2007: 349-362 - 2006
- [j14]Robert S. Lubarsky:
CZF and Second Order Arithmetic. Ann. Pure Appl. Log. 141(1-2): 29-34 (2006) - [c2]Robert S. Lubarsky:
On the Cauchy Completeness of the Constructive Cauchy Reals. CCA 2006: 225-254 - 2005
- [j13]Robert S. Lubarsky:
Independence results around constructive ZF. Ann. Pure Appl. Log. 132(2-3): 209-225 (2005) - 2003
- [j12]Michael Rathjen, Robert S. Lubarsky:
On the regular extension axiom and its variants. Math. Log. Q. 49(5): 511-518 (2003) - 2002
- [j11]Robert S. Lubarsky:
Ikp and Friends. J. Symb. Log. 67(4): 1295-1322 (2002)
1990 – 1999
- 1993
- [j10]Robert S. Lubarsky:
µ-Definable Sets of Integers. J. Symb. Log. 58(1): 291-313 (1993) - 1990
- [j9]Robert S. Lubarsky:
An Introduction to gamma-Recursion Theory (Or What to Do in KP-Foundation). J. Symb. Log. 55(1): 194-206 (1990)
1980 – 1989
- 1989
- [j8]Robert S. Lubarsky:
Sacks Forcing Sometimes Needs Help to Produce a Minimal Upper Bound. J. Symb. Log. 54(2): 490-498 (1989) - [c1]Robert S. Lubarsky:
mu-Definable Sets of Integers. LICS 1989: 343-352 - 1988
- [j7]Robert S. Lubarsky:
Another extension of Van de Wiele's theorem. Ann. Pure Appl. Log. 38(3): 301-306 (1988) - [j6]Robert S. Lubarsky:
Admissibility spectra and minimality. Ann. Pure Appl. Log. 40(3): 257-276 (1988) - [j5]Robert S. Lubarsky:
Correction to "Simple R. E. Degree Structures". J. Symb. Log. 53(1): 103-104 (1988) - [j4]Robert S. Lubarsky:
Definability and Initial Segments of c-Degrees. J. Symb. Log. 53(4): 1070-1081 (1988) - 1987
- [j3]Robert S. Lubarsky:
Lattices of c-degrees. Ann. Pure Appl. Log. 36: 115-118 (1987) - [j2]Robert S. Lubarsky:
Simple R. E. Degree Structures. J. Symb. Log. 52(1): 208-213 (1987) - [j1]Robert S. Lubarsky:
Uncountable Master Codes and the Jump Hierarchy. J. Symb. Log. 52(4): 952-958 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-16 23:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
