This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographie
[B] J. BARWISE—Admissible sets and structures, Springer 1975.
[C, Mc] P. CLOTE et K. MC ALOON—Two furthur combinatorial statements equivalent to the 1-consistency of Peano arithmetic, à paraître.
[D] M. DICKMANN—Large Infinitary Languages, N.H. 1974.
[Dr] F.DRAKE—Set Theory, An introduction to Large Cardinals, N. H. 1974.
[Fr. 1] H. FRIEDMAN—Countable models of set theories, dans Cambridge Summer School in Mathematical Logic, ed. A. Mathias et H. Rogers, SLN.
[Fr. 2] H. FRIEDMAN—Systems of second order Arithmetic with restricted induction (abstracts), JSL 41 (1976), pp. 557–559.
[K. 1] L. KIRBY—Doctoral Dissertation Manchester 1977.
[K. 2] L. KIRBY—La méthode des indicatrices et le théorème d'incomplétude, dans Modèles de l'Arithmétique, séminaire Paris 7, ed. K. Mc Aloon, Astérisque 1980.
[K.3] L. KIRBY—Flippability properties in arithmetic, à paraître.
[K,P] L. KIRBY et J. PARIS—Initial segments of models of Peano's axioms, dans Set Theory and Hierarchy Theory V, Springer Lectures Notes 619.
[Kr, Mc] J. L. KRIVINE et K. MC ALOON—Some true unprovable formulas of set theory, Bertand Russell Memorial Logic Conference, ed. Bell et al., Uldum 1971.
[Mi] G. MILLS—A combinatorial tree statement independent of Peano's arithmetic, à paraître.
[Mc.1] K. MC ALOOn—Formes combinatories du théorème d'incomplétude, Séminaire Bourbaki SLN 710.
[Mc.2] K. MC ALOON—A combinatorial characterization of inaccessible cardinals, dans Higher Set Theory, ed. G. Müller et D. Scott, SLN 1978.
[Ma] M. MAKKAI—Contribution dans Handbook of Mathematical Logic, ed. J. Barwise, North-Holland 1977.
[P] J. PARIS—Some independence results for Peano arithmetic, JSL (1979).
[Pi] A. PILLAY—Partition properties and definable types in arithmetic, ce volume.
[Q] J. QUINSEY—Thèse, Oxford 1980.
[R] J.P. RESSAYRE—Models with compactness properties relative to an admissible language, Ann. of Math. Logic (1977).
[S] L. SVENONIUS—On the denumerable models of theories with extra predicates. The Theory of Models, ed. Henkin et al. North-Holland 1965.
[V] R. VAUGHT—Descriptive set theory of ℒω1ω, dans Cambridge Summer School in Mathematical Logic, SLN.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Mc Aloon, K., Ressayre, JP. (1981). Les methodes de Kieby-Paris et la théorie des ensembles. In: Berline, C., McAloon, K., Ressayre, JP. (eds) Model Theory and Arithmetic. Lecture Notes in Mathematics, vol 890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095663
Download citation
DOI: https://doi.org/10.1007/BFb0095663
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11159-7
Online ISBN: 978-3-540-38629-2
eBook Packages: Springer Book Archive