Saul A. Kripke. An extension of a theorem of Gaifman-Hales-Solovay. Fundamenta mathematicae, vol. 61 , pp. 29–32

Journal of Symbolic Logic 34 (1):131-132 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271023

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

An Extension of a Theorem of Gaifman-Hales-Solovay.Haim Gaifman - 1967 - Fundamenta Mathematicae 61 (1):29-32.
An Extension of a Theorem of Gaifman-Hales-Solovay.Haim Gaifman - 1969 - Journal of Symbolic Logic 34 (1):131-132.
Gaifman H.. Infinite Boolean polynomials I. Fundamenta mathematicae, vol. 54 , pp. 229–250. , p. 117.)Hales A. W.. On the non-existence of free complete Boolean algebras. Fundamenta mathematicae, vol. 54 , pp. 45–66. [REVIEW]Thomas Frayne - 1967 - Journal of Symbolic Logic 32 (1):131-132.
New Proof of a Theorem of Gaifman and Hales.Robert M. Solovay - 1967 - Journal of Symbolic Logic 32 (1):132-132.
Mrówka S.. On the ideals' extension theorem and its equivalence to the axiom of choice. Fundamenta mathematicae vol. 43 , pp. 46–49.Mrówka S.. Two remarks on my paper: “On the ideals' extension theorem and its equivalence to the axiom of choice.” Fundamenta mathematicae vol. 46 , pp. 165–166.Banaschewski Bernhard. On some theorems equivalent with the axiom of choice. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 279–282. [REVIEW]Azriel Lévy - 1963 - Journal of Symbolic Logic 28 (2):168-168.
Deduction-preserving ‘Recursive Isomorphisms’ between Theories.Marian Boykan Pour-El & Saul A. Kripke - 1967 - Fundamenta Mathematicae 61:141-163.
Gaifman's theorem on categorial grammars revisited.Wojciech Buszkowski - 1988 - Studia Logica 47 (1):23 - 33.
Łos J.. On the extending of models . Fundamenta mathematicae, vol. 42 , pp. 38–54.Łos J. and Suszko R.. On the extending of models . Common extensions. Fundamenta mathematicae, vol. 42 , pp. 343–347.Słomiński J.. On the extending of models . Extensions in equationally definable classes of algebras. Fundamenta mathematicae, vol. 43 , pp. 69–76.Łos J. and Suszko R.. On the extending of models . Infinite sums of models. Fundamenta mathematicae, vol. 44 , pp. 52–60. [REVIEW]H. Jerome Keisler - 1962 - Journal of Symbolic Logic 27 (1):93-95.
Hanf W.. On a problem of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 325–334.Monk D. and Scott D.. Additions to some results of Erdös and Tarski. Fundamenta mathematicae, vol. 53 no. 3 , pp. 335–343.Hajnal A.. Remarks on the theory of W. P. Hanf. Fundamenta mathematicae vol. 54 no. 1 , pp. 109–113. [REVIEW]Jean A. Larson - 1974 - Journal of Symbolic Logic 39 (2):332-332.
Ulrich Felgner. Comparison of the axioms of local and universal choice. Fundamenta mathematicae, vol. 71 no. 1 , pp. 43–62. - Andrzej Mostowski. Models of second order arithmetic with definable Skolem functions. Fundamenta mathematicae, vol. 75 no. 3 , pp. 223–234. [REVIEW]S. G. Simpson - 1973 - Journal of Symbolic Logic 38 (4):652-653.
Mycielski Jan and Steinhaus H.. A mathematical axiom contradicting the axiom of choice. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 10 , pp. 1–3.Mycielski Jan. On the axiom of determinateness. Fundamenta mathematicae, vol. 53 , pp. 205–224.Mycielski Jan and Świerczkowski S.. On the Lebesgue measurability and the axiom of determinateness. Fundamenta mathematicae, vol. 54 , pp. 67–71.Mycielski Jan. On the axiom of determinateness . Fundamenta mathematicae, vol. 59 , pp. 203–212. [REVIEW]James E. Baumgartner - 1971 - Journal of Symbolic Logic 36 (1):164-166.
2001 annual meeting of the association for symbolic logic.Joan Feigenbaum, Haim Gaifman, Jean-Yves Girard, C. Ward Henson, Denis Hirschfeldt, Carl G. Jockusch Jr, Saul Kripke, Salma Kuhlmann, John C. Mitchell & Ernest Schimmerling - 2001 - Bulletin of Symbolic Logic 7 (3):420-435.
Fuhrken G.. Skolem-type normal forms for first-order languages with a generalized quantifier. Fundamenta mathematicae, vol. 54 , pp. 291–302.Vaught R. L.. The completeness of logic with the added quantifier “there are uncountably many.” Fundamenta mathematicae, vol. 54 , pp. 303–304. [REVIEW]Pawel Zbierski - 1968 - Journal of Symbolic Logic 33 (1):121-122.
Rasiowa H.. A proof of the compactness theorem for arithmetical classes. Fundamenta mathematicae, vol. 39 , pp. 8–14.Solomon Feferman - 1955 - Journal of Symbolic Logic 20 (1):78-78.
Włodzimierz Mostowski A.. On the decidability of some problems in special classes of groups. Fundamenta mathematicae, vol. 59 , pp. 123–135.Włodzimierz Mostowski A.. Computational algorithms for deciding some problems for nilpotent groups. Fundamenta mathematicae, vol. 59 , pp. 137–152. [REVIEW]F. B. Cannonito - 1970 - Journal of Symbolic Logic 35 (3):476-477.

Analytics

Added to PP
2013-11-22

Downloads
66 (#247,091)

6 months
11 (#242,683)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Haim Gaifman
Columbia University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references