| 2008 |
|---|
| 24 | EE | Harvey M. Friedman:
What is o-minimality?
Ann. Pure Appl. Logic 156(1): 59-67 (2008) |
| 23 | EE | Steven Kieffer,
Jeremy Avigad,
Harvey Friedman:
A language for mathematical language management
CoRR abs/0805.1386: (2008) |
| 2006 |
|---|
| 22 | EE | Jeremy Avigad,
Harvey Friedman:
Combining decision procedures for the reals
CoRR abs/cs/0601134: (2006) |
| 21 | EE | Jeremy Avigad,
Harvey Friedman:
Combining decision procedures for the reals.
Logical Methods in Computer Science 2(4): (2006) |
| 2001 |
|---|
| 20 | EE | Harvey M. Friedman:
Long Finite Sequences.
J. Comb. Theory, Ser. A 95(1): 102-144 (2001) |
| 2000 |
|---|
| 19 | EE | Solomon Feferman,
Harvey M. Friedman,
Penelope Maddy,
John R. Steel:
Does mathematics need new axioms?
Bulletin of Symbolic Logic 6(4): 401-446 (2000) |
| 1999 |
|---|
| 18 | EE | Harvey Friedman:
Some Decision Problems of Enormous Complexity.
LICS 1999: 2-13 |
| 1995 |
|---|
| 17 | | Harvey Friedman,
Michael Sheard:
Elementary Descent Recursion and Proof Theory.
Ann. Pure Appl. Logic 71(1): 1-45 (1995) |
| 1993 |
|---|
| 16 | | Harvey Friedman,
Stephen G. Simpson,
Xiaokang Yu:
Periodic Points and Subsystems of Second-Order Arithmetic.
Ann. Pure Appl. Logic 62(1): 51-64 (1993) |
| 1992 |
|---|
| 15 | | Harvey Friedman,
Robert K. Meyer:
Whither Relevant Arithmetic?
J. Symb. Log. 57(3): 824-831 (1992) |
| 1991 |
|---|
| 14 | | Harvey Friedman,
Jeffry L. Hirst:
Reverse Mathematics and Homeomorphic Embeddings.
Ann. Pure Appl. Logic 54(3): 229-253 (1991) |
| 1990 |
|---|
| 13 | | Harvey Friedman,
Jeffry L. Hirst:
Weak Comparability of Well Orderings and Reverse Mathematics.
Ann. Pure Appl. Logic 47(1): 11-29 (1990) |
| 1989 |
|---|
| 12 | | Harvey Friedman,
Lee J. Stanley:
A Borel Reducibility Theory for Classes of Countable Structures.
J. Symb. Log. 54(3): 894-914 (1989) |
| 11 | | Harvey Friedman,
Michael Sheard:
The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic.
J. Symb. Log. 54(4): 1456-1459 (1989) |
| 1984 |
|---|
| 10 | | Harvey Friedman:
On the Spectra of Universal Relational Sentences
Information and Control 62(2/3): 205-209 (1984) |
| 1982 |
|---|
| 9 | | Ker-I Ko,
Harvey Friedman:
Computational Complexity of Real Functions.
Theor. Comput. Sci. 20: 323-352 (1982) |
| 1977 |
|---|
| 8 | | Harvey Friedman:
On the Derivability of Instantiation Properties.
J. Symb. Log. 42(4): 506-514 (1977) |
| 1976 |
|---|
| 7 | | Harvey Friedman:
Uniformly Defined Descending Sequences of Degrees.
J. Symb. Log. 41(2): 363-367 (1976) |
| 1975 |
|---|
| 6 | | Harvey Friedman:
One Hundred and Two Problems in Mathematical Logic.
J. Symb. Log. 40(2): 113-129 (1975) |
| 1974 |
|---|
| 5 | | Harvey Friedman:
PCA Well-Orderings of the Line.
J. Symb. Log. 39(1): 79-80 (1974) |
| 4 | | Harvey Friedman:
On Existence Proofs of Hanf Numbers.
J. Symb. Log. 39(2): 318-324 (1974) |
| 1973 |
|---|
| 3 | | Harvey Friedman:
The Consistency of Classical Set Theory Relative to a Set Theory with Intuitionistic Logic.
J. Symb. Log. 38(2): 315-319 (1973) |
| 2 | | Harvey M. Friedman:
Borel Sets and Hyperdegrees.
J. Symb. Log. 38(3): 405-409 (1973) |
| 1969 |
|---|
| 1 | | Harvey Friedman:
Bar Induction and Pi11-CA1.
J. Symb. Log. 34(3): 353-362 (1969) |
