Harvey M. Friedman

发表

Classically and intuitionistically provably recursive functions

Harvey M. Friedman, H. Friedman, 1978 .

Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory

Harvey M. Friedman, H. Friedman, 1971 .

Epistemic and intuitionistic formal systems

Harvey M. Friedman, R. C. Flagg, H. Friedman, 1986, Ann. Pure Appl. Log..

PCA Well-Orderings of the Line

Harvey M. Friedman, 1974, J. Symb. Log..

Borel Sets and Hyperdegrees

Harvey M. Friedman, 1973, J. Symb. Log..

Long Finite Sequences

Harvey M. Friedman, H. Friedman, 2001, J. Comb. Theory A.

Primitive Independence Results

Harvey M. Friedman, 2003, J. Math. Log..

A language for mathematical language management pdf

Jeremy Avigad, Harvey M. Friedman, Steven Kieffer, 2008, ArXiv.

Whither Relevant Arithmetic?

Robert K. Meyer, Harvey M. Friedman, 1992, J. Symb. Log..

Periodic Points and Subsystems of Second-Order Arithmetic

Xiaokang Yu, Stephen G. Simpson, S. G. Simpson, 1993, Ann. Pure Appl. Log..

Addendum to "countable algebra and set existence axioms"

Stephen G. Simpson, Harvey M. Friedman, Rick L. Smith, 1985, Ann. Pure Appl. Log..

The consistency of classical set theory relative to a set theory with intu1tionistic logic

Harvey M. Friedman, H. Friedman, 1973, Journal of Symbolic Logic.

The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic

Harvey M. Friedman, Michael Sheard, 1989, J. Symb. Log..

Some decision problems of enormous complexity

Harvey M. Friedman, H. Friedman, 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

The disjunction and existence properties for axiomatic systems of truth

Harvey M. Friedman, Michael Sheard, 1988, Ann. Pure Appl. Log..

One hundred and two problems in mathematical logic

Harvey M. Friedman, H. Friedman, 1975, Journal of Symbolic Logic.

Weak Comparability of Well Orderings and Reverse Mathematics

Jeffry L. Hirst, Harvey M. Friedman, 1990, Ann. Pure Appl. Log..

Lindenbaum algebras of intuitionistic theories and free categories

Andre Scedrov, Harvey M. Friedman, Peter J. Freyd, 1987, Ann. Pure Appl. Log..

Concrete Mathematical Incompleteness: Basic Emulation Theory

Harvey M. Friedman, 2018 .

Uniformly Defined Descending Sequences of Degrees

Harvey M. Friedman, 1976, J. Symb. Log..

A Way Out

Harvey M. Friedman, H. Friedman, 2003 .

Elementary Descent Recursion and Proof Theory

Harvey M. Friedman, Michael Sheard, H. Friedman, 1995, Ann. Pure Appl. Log..

Does Mathematics Need New Axioms?

John R. Steel, Solomon Feferman, Penelope Maddy, 2000, Bulletin of Symbolic Logic.

Concept Calculus: Much Better Than

W. Hugh Woodin, Harvey M. Friedman, Michael Heller, 2011 .

Building a push-button RESOLVE verifier: Progress and challenges

Murali Sitaraman, Bruce W. Weide, Jeremy Avigad, 2011, Formal Aspects of Computing.

On the derivability of instantiation properties

Harvey M. Friedman, Harvey M. Friedman, H. Friedman, 1977, Journal of Symbolic Logic.

Syrus: providing practice problems in discrete mathematics with instant feedback

Bruce W. Weide, Jason Kirschenbaum, Harvey M. Friedman, 2014, SIGCSE '14.

Expansions of the real field by open sets: definability versus interpretability

Chris Miller, Harvey M. Friedman, Krzysztof Kurdyka, 2010, J. Symb. Log..

This Foundationalist Looks at P = NP

Harvey M. Friedman, 2018, SOEN.

On the Spectra of Universal Relational Sentences

Harvey M. Friedman, 1984, Inf. Control..

Subtle cardinals and linear orderings

Harvey M. Friedman, 2001, Ann. Pure Appl. Log..

A cumulative hierarchy of predicates

Harvey M. Friedman, 1975, Math. Log. Q..

On Existence Proofs of Hanf Numbers

Harvey M. Friedman, 1974, J. Symb. Log..

Maximality in modal logic

Harvey M. Friedman, R. C. Flagg, H. Friedman, 1987, Ann. Pure Appl. Log..

Reverse Mathematics and Homeomorphic Embeddings

Jeffry L. Hirst, Harvey M. Friedman, 1991, Ann. Pure Appl. Log..

Expansions of o-minimal structures by fast sequences

Chris Miller, Harvey M. Friedman, 2005, J. Symb. Log..

Set existence property for intuitionistic theories with dependent choice

Andre Scedrov, Harvey M. Friedman, 1983, Ann. Pure Appl. Log..

Perspectives on formal verification (invited talk)

Harvey M. Friedman, 2016, CPP.

A Borel reductibility theory for classes of countable structures

Harvey M. Friedman, Lee J. Stanley, H. Friedman, 1989, Journal of Symbolic Logic.

Bar Induction and Pi11-CA1

Harvey M. Friedman, H. Friedman, 1969, J. Symb. Log..

An axiomatic approach to self-referential truth

Harvey M. Friedman, Michael Sheard, 1987, Ann. Pure Appl. Log..

Countable algebra and set existence axioms

Stephen G. Simpson, S. G. Simpson, Harvey M. Friedman, 1983, Ann. Pure Appl. Log..

Large sets in intuitionistic set theory

Andre Scedrov, Harvey M. Friedman, H. Friedman, 1984, Ann. Pure Appl. Log..

What is o-minimality?

Harvey M. Friedman, 2008, Ann. Pure Appl. Log..

Combining decision procedures for the reals pdf

Jeremy Avigad, Harvey M. Friedman, H. Friedman, 2006, Log. Methods Comput. Sci..

Immune Evasion by Herpes Simplex Virus

Harvey M. Friedman, 2005 .

Protection Provided by a Herpes Simplex Virus 2 (HSV-2) Glycoprotein C and D Subunit Antigen Vaccine against Genital HSV-2 Infection in HSV-1-Seropositive Guinea Pigs

Harvey M. Friedman, Maya S. Salnikova, Sita Awasthi, 2013, Journal of Virology.