default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Shafer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Marta Fiori-Carones
, Alberto Marcone, Paul Shafer, Giovanni Soldà:
(Extra)ordinary Equivalences with the ascending/descending sequence Principle. J. Symb. Log. 89(1): 262-307 (2024)- 2023
- [j17]Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov, Paul Shafer, Alexandra A. Soskova, Stefan V. Vatev:
On Cohesive powers of linear Orders. J. Symb. Log. 88(3): 947-1004 (2023) - 2021
- [j16]Paul Shafer, Sebastiaan A. Terwijn:
Ordinal Analysis of Partial Combinatory Algebras. J. Symb. Log. 86(3): 1154-1188 (2021) - 2020
- [j15]Paul Shafer:
The strength of compactness for countable complete linear orders. Comput. 9(1): 25-36 (2020) - [j14]André Nies, Paul Shafer:
Randomness Notions and Reverse Mathematics. J. Symb. Log. 85(1): 271-299 (2020) - [i1]Paul Shafer, Sebastiaan A. Terwijn:
Ordinal analysis of partial combinatory algebras. CoRR abs/2010.12452 (2020)
2010 – 2019
- 2019
- [j13]Paul Shafer, Andrea Sorbi:
Comparing the degrees of enumerability and the closed Medvedev degrees. Arch. Math. Log. 58(5-6): 527-542 (2019) - [c1]Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov, Paul Shafer, Alexandra A. Soskova, Stefan V. Vatev:
Cohesive Powers of Linear Orders. CiE 2019: 168-180 - 2017
- [j12]Paul Shafer:
Honest elementary degrees and degrees of relative provability without the cupping property. Ann. Pure Appl. Log. 168(5): 1017-1031 (2017) - [j11]Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter, Paul Shafer:
Randomness and Semimeasures. Notre Dame J. Formal Log. 58(3): 301-328 (2017) - 2016
- [j10]Emanuele Frittaion, Matthew Hendtlass, Alberto Marcone, Paul Shafer, Jeroen Van der Meeren:
Reverse mathematics, well-quasi-orders, and Noetherian spaces. Arch. Math. Log. 55(3-4): 431-459 (2016) - 2015
- [j9]Rupert Hölzl, Paul Shafer:
Universality, optimality, and randomness deficiency. Ann. Pure Appl. Log. 166(10): 1049-1069 (2015) - [j8]François G. Dorais, Jeffry L. Hirst, Paul Shafer:
Comparing the strength of diagonally Nonrecursive Functions in the Absence of ∑20 Induction. J. Symb. Log. 80(4): 1211-1235 (2015) - 2013
- [j7]François G. Dorais, Jeffry L. Hirst, Paul Shafer:
Reverse Mathematics and Algebraic Field Extensions. Comput. 2(2): 75-92 (2013) - 2012
- [j6]Paul Shafer:
Menger's theorem in Π11-CA0. Arch. Math. Log. 51(3-4): 407-423 (2012) - [j5]Paul Shafer:
Coding true arithmetic in the Medvedev degrees of Π10 classes. Ann. Pure Appl. Log. 163(3): 321-337 (2012) - [j4]François G. Dorais, Jeffry L. Hirst, Paul Shafer:
Reverse mathematics, trichotomy, and dichotomy. J. Log. Anal. 4 (2012) - 2011
- [j3]Paul Shafer:
Coding true arithmetic in the Medvedev and Muchnik degrees. J. Symb. Log. 76(1): 267-288 (2011) - [j2]Paul Shafer:
Characterizing the Join-Irreducible Medvedev Degrees. Notre Dame J. Formal Log. 52(1): 21-38 (2011)
2000 – 2009
- 2006
- [j1]Paul Shafer, Timothy Isganitis, Golan Yona:
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities. BMC Bioinform. 7: 71 (2006)
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-06-10 20:31 CEST 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:
