Search the dblp DataBase
Harvey Friedman :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Harvey Friedman Some Decision Problems of Enormous Complexity. [Citation Graph (0, 0)][DBLP ] LICS, 1999, pp:2-13 [Conf ] Harvey Friedman , Jeffry L. Hirst Weak Comparability of Well Orderings and Reverse Mathematics. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1990, v:47, n:1, pp:11-29 [Journal ] Harvey Friedman , Jeffry L. Hirst Reverse Mathematics and Homeomorphic Embeddings. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1991, v:54, n:3, pp:229-253 [Journal ] Harvey Friedman , Michael Sheard Elementary Descent Recursion and Proof Theory. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1995, v:71, n:1, pp:1-45 [Journal ] Harvey Friedman , Stephen G. Simpson , Xiaokang Yu Periodic Points and Subsystems of Second-Order Arithmetic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1993, v:62, n:1, pp:51-64 [Journal ] Harvey Friedman On the Spectra of Universal Relational Sentences [Citation Graph (0, 0)][DBLP ] Information and Control, 1984, v:62, n:2/3, pp:205-209 [Journal ] Harvey Friedman Bar Induction and Pi1 1 -CA1 . [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1969, v:34, n:3, pp:353-362 [Journal ] Harvey Friedman The Consistency of Classical Set Theory Relative to a Set Theory with Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1973, v:38, n:2, pp:315-319 [Journal ] Harvey Friedman PCA Well-Orderings of the Line. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1974, v:39, n:1, pp:79-80 [Journal ] Harvey Friedman On Existence Proofs of Hanf Numbers. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1974, v:39, n:2, pp:318-324 [Journal ] Harvey Friedman One Hundred and Two Problems in Mathematical Logic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1975, v:40, n:2, pp:113-129 [Journal ] Harvey Friedman Uniformly Defined Descending Sequences of Degrees. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1976, v:41, n:2, pp:363-367 [Journal ] Harvey Friedman On the Derivability of Instantiation Properties. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1977, v:42, n:4, pp:506-514 [Journal ] Harvey Friedman , Robert K. Meyer Whither Relevant Arithmetic? [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1992, v:57, n:3, pp:824-831 [Journal ] Harvey Friedman , Lee J. Stanley A Borel Reducibility Theory for Classes of Countable Structures. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1989, v:54, n:3, pp:894-914 [Journal ] Harvey Friedman , Michael Sheard The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1989, v:54, n:4, pp:1456-1459 [Journal ] Jeremy Avigad , Harvey Friedman Combining decision procedures for the reals. [Citation Graph (0, 0)][DBLP ] Logical Methods in Computer Science, 2006, v:2, n:4, pp:- [Journal ] Ker-I Ko , Harvey Friedman Computational Complexity of Real Functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1982, v:20, n:, pp:323-352 [Journal ] Jeremy Avigad , Harvey Friedman Combining decision procedures for the reals [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] A language for mathematical language management [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.002secs