Finite Trees And The Necessary Use Of Large Cardinals (1998)

by By Harvey Friedman , Harvey M. Friedman
Citations:3 - 1 self

Documents Related by Co-Citation

2 Some remarks on infinitely long formulas, in (no editor given) Infinistic Methods – L Henkin - 1961
12 Some combinatorics of imperfect information – Peter Cameron, Wilfrid Hodges
4 Hierarchies of partially ordered connectives and quantifiers – M Krynicki - 1993
21 Some strange quantifiers – Wilfrid Hodges - 1997
24 HENKIN QUANTIFIERS AND COMPLETE PROBLEMS – Andreas Blass, et al. - 1986
20 Formal Feature of Compositionality – R Hodges - 2001
34 Elementary predicate logic – W Hodges - 1983
34 Introduction to transcendental numbers – Serge Lang - 1966
540 Model Theory – Wilfrid Hodges - 2000
72 Game-theoretical semantics – Jaako Hintikka, Gabriel Sandu - 1997
51 Compositional Semantics for a Language of Imperfect Information – Wilfrid Hodges - 1997
5 Classifying inaccessible cardinals (abstract – William P Hanf, Dana S Scott - 1961
8 Some applications of model theory in set theory – Jack H Silver - 1966
12 Ineffability properties of cardinals – J Baumgartner - 1977
28 Finite functions and the necessary use of large cardinals – Harvey M. Friedman - 1998
11 Incompactness in languages with infinitely long expressions,k Fundamenta Mathematicae 53 – William P Hanf - 1964
29 The evolution of large cardinal axioms in set theory – A Kanamori, M Magidor - 1978
1 Eine Bemerking zur Theorie der regressive Funktionen – Geza Fodor - 1956
1 On some problems of Erd̦s-Hajnal (abstract РWilliam N Reinhardt, Jack H Silver - 1965