Harvey Friedman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2018

This Foundationalist Looks at P = NPHarvey Friedman. sigsoft, 43(3):19, 2018. [doi]

2010

Expansions of the real field by open sets: definability versus interpretabilityHarvey Friedman, Krzysztof Kurdyka, Chris Miller, Patrick Speissegger. JSYML, 75(4):1311-1325, 2010. [doi]

2006

Combining decision procedures for the realsJeremy Avigad, Harvey Friedman. lmcs, 2(4), 2006. [doi]

2005

Expansions of o-minimal structures by fast sequencesHarvey Friedman, Chris Miller. JSYML, 70(2):410-418, 2005. [doi]

1999

Some Decision Problems of Enormous ComplexityHarvey Friedman. lics 1999: 2-13 [doi]

1995

Elementary Descent Recursion and Proof TheoryHarvey Friedman, Michael Sheard. APAL, 71(1):1-45, 1995.

1993

Periodic Points and Subsystems of Second-Order ArithmeticHarvey Friedman, Stephen G. Simpson, Xiaokang Yu. APAL, 62(1):51-64, 1993.

1992

Whither Relevant Arithmetic?Harvey Friedman, Robert K. Meyer. JSYML, 57(3):824-831, 1992.

1991

Reverse Mathematics and Homeomorphic EmbeddingsHarvey Friedman, Jeffry L. Hirst. APAL, 54(3):229-253, 1991.

1990

Weak Comparability of Well Orderings and Reverse MathematicsHarvey Friedman, Jeffry L. Hirst. APAL, 47(1):11-29, 1990.

1989

A Borel Reducibility Theory for Classes of Countable StructuresHarvey Friedman, Lee J. Stanley. JSYML, 54(3):894-914, 1989.

The Equivalence of the Disjunction and Existence Properties for Modal ArithmeticHarvey Friedman, Michael Sheard. JSYML, 54(4):1456-1459, 1989.

1987

Lindenbaum algebras of intuitionistic theories and free categoriesPeter J. Freyd, Harvey Friedman, Andre Scedrov. APAL, 35:167-172, 1987. [doi]

1984

On the Spectra of Universal Relational SentencesHarvey Friedman. iandc, 62(2/3):205-209, August/September 1984.

1982

Computational Complexity of Real FunctionsKer-I Ko, Harvey Friedman. TCS, 20:323-352, 1982.

1977

On the Derivability of Instantiation PropertiesHarvey Friedman. JSYML, 42(4):506-514, 1977.

1976

Uniformly Defined Descending Sequences of DegreesHarvey Friedman. JSYML, 41(2):363-367, 1976.

1975

One Hundred and Two Problems in Mathematical LogicHarvey Friedman. JSYML, 40(2):113-129, 1975.

A cumulative hierarchy of predicatesHarvey Friedman. mlq, 21(1):309-314, 1975. [doi]

1974

PCA Well-Orderings of the LineHarvey Friedman. JSYML, 39(1):79-80, 1974.

On Existence Proofs of Hanf NumbersHarvey Friedman. JSYML, 39(2):318-324, 1974.

1973

The Consistency of Classical Set Theory Relative to a Set Theory with Intuitionistic LogicHarvey Friedman. JSYML, 38(2):315-319, 1973.

1969

Bar Induction and Pi:::1:::::1::-CA:::1:::Harvey Friedman. JSYML, 34(3):353-362, 1969.

Sign in or sign up to see more results.

runs on WebDSL