A Borel reductibility theory for classes of countable structures
- H. Friedman, L. Stanley
- MathematicsJournal of Symbolic Logic (JSL)
- 1 September 1989
Abstract We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to…
Classically and intuitionistically provably recursive functions
- H. Friedman
- Computer Science
- 1978
An axiomatic approach to self-referential truth
- H. Friedman, M. Sheard
- PhilosophyAnnals of Pure and Applied Logic
- 1987
Countable models of set theories
- H. Friedman
- Mathematics
- 1973
Countable algebra and set existence axioms
- H. Friedman, S. G. Simpson, Rick L. Smith
- Mathematics, Computer ScienceAnnals of Pure and Applied Logic
- 1 November 1983
Some applications of Kleene's methods for intuitionistic systems
- H. Friedman
- Computer Science
- 1973
Computational Complexity of Real Functions
- K. Ko, H. Friedman
- Computer Science, MathematicsTheoretical Computer Science
- 1 July 1982
Higher set theory and mathematical practice
- H. Friedman
- Philosophy
- 1971
Expansions of o-minimal structures by sparse sets
- H. Friedman, Chris Miller
- Mathematics
- 2001
Given an o-minimal expansion R of the ordered additive group of real numbers and E ⊆ R, we consider the extent to which basic metric and topological properties of subsets of R definable in the…
...
...