Harvey M. Friedman

According to our database1, Harvey M. Friedman authored at least 42 papers between 1969 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
This Foundationalist Looks at P = NP.
ACM SIGSOFT Softw. Eng. Notes, 2018

2016
Perspectives on formal verification (invited talk).
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2014
Syrus: providing practice problems in discrete mathematics with instant feedback.
Proceedings of the 45th ACM Technical Symposium on Computer Science Education, 2014

2011
Building a push-button RESOLVE verifier: Progress and challenges.
Formal Aspects Comput., 2011

2010
Expansions of the real field by open sets: definability versus interpretability.
J. Symb. Log., 2010

2008
A language for mathematical language management
CoRR, 2008

What is o-minimality?
Ann. Pure Appl. Log., 2008

2006
Combining decision procedures for the reals.
Log. Methods Comput. Sci., 2006

2005
Expansions of o-minimal structures by fast sequences.
J. Symb. Log., 2005

2003
Primitive Independence Results.
J. Math. Log., 2003

2001
Long Finite Sequences.
J. Comb. Theory, Ser. A, 2001

Subtle cardinals and linear orderings.
Ann. Pure Appl. Log., 2001

2000
Does mathematics need new axioms?
Bull. Symb. Log., 2000

1999
Some Decision Problems of Enormous Complexity.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1995
Elementary Descent Recursion and Proof Theory.
Ann. Pure Appl. Log., 1995

1993
Periodic Points and Subsystems of Second-Order Arithmetic.
Ann. Pure Appl. Log., 1993

1992
Whither Relevant Arithmetic?
J. Symb. Log., 1992

1991
Reverse Mathematics and Homeomorphic Embeddings.
Ann. Pure Appl. Log., 1991

1990
Weak Comparability of Well Orderings and Reverse Mathematics.
Ann. Pure Appl. Log., 1990

1989
The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic.
J. Symb. Log., 1989

A Borel Reducibility Theory for Classes of Countable Structures.
J. Symb. Log., 1989

1988
The disjunction and existence properties for axiomatic systems of truth.
Ann. Pure Appl. Log., 1988

1987
An axiomatic approach to self-referential truth.
Ann. Pure Appl. Log., 1987

Lindenbaum algebras of intuitionistic theories and free categories.
Ann. Pure Appl. Log., 1987

Maximality in modal logic.
Ann. Pure Appl. Log., 1987

1986
Intuitionistically provable recursive well-orderings.
Ann. Pure Appl. Log., 1986

Epistemic and intuitionistic formal systems.
Ann. Pure Appl. Log., 1986

1985
Addendum to "countable algebra and set existence axioms".
Ann. Pure Appl. Log., 1985

1984
On the Spectra of Universal Relational Sentences
Inf. Control., 1984

Large sets in intuitionistic set theory.
Ann. Pure Appl. Log., 1984

1983
Countable algebra and set existence axioms.
Ann. Pure Appl. Log., 1983

Set existence property for intuitionistic theories with dependent choice.
Ann. Pure Appl. Log., 1983

1982
Computational Complexity of Real Functions.
Theor. Comput. Sci., 1982

1977
On the Derivability of Instantiation Properties.
J. Symb. Log., 1977

1976
Uniformly Defined Descending Sequences of Degrees.
J. Symb. Log., 1976

1975
A cumulative hierarchy of predicates.
Math. Log. Q., 1975

One Hundred and Two Problems in Mathematical Logic.
J. Symb. Log., 1975

1974
On Existence Proofs of Hanf Numbers.
J. Symb. Log., 1974

PCA Well-Orderings of the Line.
J. Symb. Log., 1974

1973
Borel Sets and Hyperdegrees.
J. Symb. Log., 1973

The Consistency of Classical Set Theory Relative to a Set Theory with Intuitionistic Logic.
J. Symb. Log., 1973

1969
Bar Induction and Pi<sup>1</sup><sub>1</sub>-CA<sup>1</sup>.
J. Symb. Log., 1969


  Loading...