Finite Trees And The Necessary Use Of Large Cardinals

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

by By Harvey Friedman , Harvey M. Friedman

Citations:

2	Some remarks on infinitely long formulas, in (no editor given) Infinistic Methods – L Henkin - 1961
3	Hierarchies of partially ordered connectives and quantifiers – M Krynicki - 1993
18	Formal features of compositionality – Wilfrid Hodges - 2001
11	Some combinatorics of imperfect information – P Cameron, W Hodges - 2001
20	HENKIN QUANTIFIERS AND COMPLETE PROBLEMS – Andreas Blass, et al. - 1986
32	1983]: ‘Elementary predicate logic – W Hodges - 1977
28	Introduction to transcendental numbers – S Lang - 1966
66	Game-theoretical semantics – Jaako Hintikka, Gabriel Sandu - 1997
18	Some strange quantifiers – Wilfried Hodges - 1997
448	Model Theory – Wilfrid Hodges - 2000
46	Compositional Semantics for a Language of Imperfect Information – Wilfrid Hodges - 1997
1	Eine Bemerking zur Theorie der regressive Funktionen – Geza Fodor - 1956
1	On some problems of Erds-Hajnal (abstract – William N Reinhardt, Jack H Silver - 1965
5	1961], Classifying inaccessible cardinals (abstract), Notices A.M.S – W P Hanf, D Scott
10	Ineffability properties of cardinals I – J Baumgartner - 1975
11	Incompactness in languages with infinitely long expressions – W Hanf - 1964
8	Some applications of model theory in set theory – J Silver - 1966
23	Finite functions and the necessary use of large cardinals – Harvey M Friedman - 1998
25	The Evolution of Large Cardinal Axioms in Set Theory – A Kanamori, M Magidor - 1978