default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHarvey M. Friedman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j38]Harvey Friedman:
This Foundationalist Looks at P = NP. ACM SIGSOFT Softw. Eng. Notes 43(3): 19 (2018)- 2016
- [c3]Harvey M. Friedman:
Perspectives on formal verification (invited talk). CPP 2016: 1 - 2014
- [c2]Diego Zaccai, Aditi Tagore, Dustin Hoffman, Jason Kirschenbaum, Zakariya Bainazarov, Harvey M. Friedman, Dennis K. Pearl, Bruce W. Weide:
Syrus: providing practice problems in discrete mathematics with instant feedback. SIGCSE 2014: 61-66 - 2011
- [j37]Murali Sitaraman, Bruce M. Adcock, Jeremy Avigad
, Derek Bronish, Paolo Bucci, David Frazier, Harvey M. Friedman, Heather K. Harton, Wayne D. Heym, Jason Kirschenbaum, Joan Krone, Hampton Smith, Bruce W. Weide:
Building a push-button RESOLVE verifier: Progress and challenges. Formal Aspects Comput. 23(5): 607-626 (2011) - 2010
- [j36]Harvey Friedman, Krzysztof Kurdyka, Chris Miller, Patrick Speissegger:
Expansions of the real field by open sets: definability versus interpretability. J. Symb. Log. 75(4): 1311-1325 (2010)
2000 – 2009
- 2008
- [j35]Harvey M. Friedman:
What is o-minimality? Ann. Pure Appl. Log. 156(1): 59-67 (2008) - [i2]Steven Kieffer, Jeremy Avigad, Harvey Friedman:
A language for mathematical language management. CoRR abs/0805.1386 (2008) - 2006
- [j34]Jeremy Avigad, Harvey Friedman:
Combining decision procedures for the reals. Log. Methods Comput. Sci. 2(4) (2006) - [i1]Jeremy Avigad, Harvey Friedman:
Combining decision procedures for the reals. CoRR abs/cs/0601134 (2006) - 2005
- [j33]Harvey Friedman, Chris Miller:
Expansions of o-minimal structures by fast sequences. J. Symb. Log. 70(2): 410-418 (2005) - 2003
- [j32]Harvey M. Friedman:
Primitive Independence Results. J. Math. Log. 3(1) (2003) - 2001
- [j31]Harvey M. Friedman:
Subtle cardinals and linear orderings. Ann. Pure Appl. Log. 107(1-3): 1-34 (2001) - [j30]Harvey M. Friedman:
Long Finite Sequences. J. Comb. Theory A 95(1): 102-144 (2001) - 2000
- [j29]Solomon Feferman, Harvey M. Friedman, Penelope Maddy, John R. Steel:
Does mathematics need new axioms? Bull. Symb. Log. 6(4): 401-446 (2000)
1990 – 1999
- 1999
- [c1]Harvey Friedman:
Some Decision Problems of Enormous Complexity. LICS 1999: 2-12 - 1995
- [j28]Harvey Friedman, Michael Sheard:
Elementary Descent Recursion and Proof Theory. Ann. Pure Appl. Log. 71(1): 1-45 (1995) - 1993
- [j27]Harvey Friedman, Stephen G. Simpson, Xiaokang Yu:
Periodic Points and Subsystems of Second-Order Arithmetic. Ann. Pure Appl. Log. 62(1): 51-64 (1993) - 1992
- [j26]Harvey Friedman, Robert K. Meyer:
Whither Relevant Arithmetic? J. Symb. Log. 57(3): 824-831 (1992) - 1991
- [j25]Harvey Friedman, Jeffry L. Hirst:
Reverse Mathematics and Homeomorphic Embeddings. Ann. Pure Appl. Log. 54(3): 229-253 (1991) - 1990
- [j24]Harvey Friedman, Jeffry L. Hirst:
Weak Comparability of Well Orderings and Reverse Mathematics. Ann. Pure Appl. Log. 47(1): 11-29 (1990)
1980 – 1989
- 1989
- [j23]Harvey Friedman, Lee J. Stanley:
A Borel Reducibility Theory for Classes of Countable Structures. J. Symb. Log. 54(3): 894-914 (1989) - [j22]Harvey Friedman, Michael Sheard:
The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic. J. Symb. Log. 54(4): 1456-1459 (1989) - 1988
- [j21]Harvey M. Friedman, Michael Sheard:
The disjunction and existence properties for axiomatic systems of truth. Ann. Pure Appl. Log. 40(1): 1-10 (1988) - 1987
- [j20]Harvey M. Friedman, Michael Sheard:
An axiomatic approach to self-referential truth. Ann. Pure Appl. Log. 33: 1-21 (1987) - [j19]Robert C. Flagg, Harvey M. Friedman:
Maximality in modal logic. Ann. Pure Appl. Log. 34(2): 99-118 (1987) - [j18]Peter J. Freyd, Harvey Friedman, Andre Scedrov:
Lindenbaum algebras of intuitionistic theories and free categories. Ann. Pure Appl. Log. 35: 167-172 (1987) - 1986
- [j17]Harvey M. Friedman, Andre Scedrov:
Intuitionistically provable recursive well-orderings. Ann. Pure Appl. Log. 30(2): 165-171 (1986) - [j16]Robert C. Flagg, Harvey M. Friedman:
Epistemic and intuitionistic formal systems. Ann. Pure Appl. Log. 32: 53-60 (1986) - 1985
- [j15]Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith:
Addendum to "countable algebra and set existence axioms". Ann. Pure Appl. Log. 28(3): 319-320 (1985) - 1984
- [j14]Harvey M. Friedman, Andrej Scedrov:
Large sets in intuitionistic set theory. Ann. Pure Appl. Log. 27(1): 1-24 (1984) - [j13]Harvey Friedman:
On the Spectra of Universal Relational Sentences. Inf. Control. 62(2/3): 205-209 (1984) - 1983
- [j12]Harvey M. Friedman, Andrej Scedrov:
Set existence property for intuitionistic theories with dependent choice. Ann. Pure Appl. Log. 25(2): 129-140 (1983) - [j11]Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith:
Countable algebra and set existence axioms. Ann. Pure Appl. Log. 25(2): 141-181 (1983) - 1982
- [j10]Ker-I Ko, Harvey Friedman:
Computational Complexity of Real Functions. Theor. Comput. Sci. 20: 323-352 (1982)
1970 – 1979
- 1977
- [j9]Harvey Friedman:
On the Derivability of Instantiation Properties. J. Symb. Log. 42(4): 506-514 (1977) - 1976
- [j8]Harvey Friedman:
Uniformly Defined Descending Sequences of Degrees. J. Symb. Log. 41(2): 363-367 (1976) - 1975
- [j7]Harvey Friedman:
One Hundred and Two Problems in Mathematical Logic. J. Symb. Log. 40(2): 113-129 (1975) - [j6]Harvey Friedman:
A cumulative hierarchy of predicates. Math. Log. Q. 21(1): 309-314 (1975) - 1974
- [j5]Harvey Friedman:
PCA Well-Orderings of the Line. J. Symb. Log. 39(1): 79-80 (1974) - [j4]Harvey Friedman:
On Existence Proofs of Hanf Numbers. J. Symb. Log. 39(2): 318-324 (1974) - 1973
- [j3]Harvey Friedman:
The Consistency of Classical Set Theory Relative to a Set Theory with Intuitionistic Logic. J. Symb. Log. 38(2): 315-319 (1973) - [j2]Harvey M. Friedman:
Borel Sets and Hyperdegrees. J. Symb. Log. 38(3): 405-409 (1973)
1960 – 1969
- 1969
- [j1]Harvey Friedman:
Bar Induction and Pi11-CA1. J. Symb. Log. 34(3): 353-362 (1969)
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 2025-01-07 00:58 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:
