The following pages link to Harvey M. Friedman (Q196044):
Displaying 50 items.
- Foundational aspects of singular integrals (Q472499) (← links)
- (Q580342) (redirect page) (← links)
- Epistemic and intuitionistic formal systems (Q580343) (← links)
- Set existence property for intuitionistic theories with dependent choice (Q793723) (← links)
- Corrigendum to ``Set existence property for intuitionistic theories with dependent choice'' (Q793724) (← links)
- Unary Borel functions and second-order arithmetic (Q795831) (← links)
- Large sets in intuitionistic set theory (Q796524) (← links)
- Decidability in elementary analysis. II (Q912081) (← links)
- Weak comparability of well orderings and reverse mathematics (Q918549) (← links)
- A framework for measuring the complexity of mathematical concepts (Q920074) (← links)
- What is o-minimality? (Q958486) (← links)
- (Q1057266) (redirect page) (← links)
- The computational complexity of maximization and integration (Q1057267) (← links)
- Countable algebra and set existence axioms (Q1063593) (← links)
- Addendum to ``Countable algebra and set existence axioms'' (Q1063594) (← links)
- The lack of definable witnesses and provably recursive functions in intuitionistic set theories (Q1071017) (← links)
- Arithmetic transfinite induction and recursive well-orderings (Q1071019) (← links)
- Necessary uses of abstract set theory in finite mathematics (Q1088658) (← links)
- Maximality in modal logic (Q1092032) (← links)
- Lindenbaum algebras of intuitionistic theories and free categories (Q1092043) (← links)
- An axiomatic approach to self-referential truth (Q1096626) (← links)
- Computing power series in polynomial time (Q1102956) (← links)
- The disjunction and existence properties for axiomatic systems of truth (Q1118582) (← links)
- A definable nonseparable invariant extension of Lebesgue measure (Q1133635) (← links)
- A consistent Fubini-Tonelli theorem for nonmeasurable functions (Q1155739) (← links)
- On the necessary use of abstract set theory (Q1163016) (← links)
- Computational complexity of real functions (Q1171056) (← links)
- Reverse mathematics and homeomorphic embeddings (Q1182482) (← links)
- On decidability of equational theories (Q1224092) (← links)
- Set theoretic foundations for constructive analysis (Q1236108) (← links)
- Provable equality in primitive recursive arithmetic with and without induction (Q1236526) (← links)
- The complexity of explicit definitions (Q1237065) (← links)
- Finite functions and the necessary use of large cardinals (Q1281440) (← links)
- Elementary descent recursion and proof theory (Q1344279) (← links)
- Intuitionistically provable recursive well-orderings (Q1820780) (← links)
- Decidability in elementary analysis. I (Q1823233) (← links)
- Subtle cardinals and linear orderings (Q1840455) (← links)
- Periodic points and subsystems of second-order arithmetic (Q2367412) (← links)
- Beth's theorem in cardinality logics (Q2561208) (← links)
- Expansions of o-minimal structures by sparse sets (Q2717641) (← links)
- Independence of Ramsey theorem variants using $\varepsilon _0$ (Q2789881) (← links)
- (Q2856501) (← links)
- (Q3012516) (← links)
- A Borel reductibility theory for classes of countable structures (Q3033746) (← links)
- Expansions of the real field by open sets: definability versus interpretability (Q3066795) (← links)
- (Q3214890) (← links)
- (Q3215216) (← links)
- The equivalence of the disjunction and existence properties for modal arithmetic (Q3486545) (← links)
- (Q3509163) (← links)
- (Q3656426) (← links)
