Σ1-compactness in languages stronger than

Journal of Symbolic Logic 43 (3):508 - 520 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273528

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,459

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

$mathbf{Sigma}1$-Compactness in Languages Stronger than $mathscr{L}A$.Nigel Cutland - 1978 - Journal of Symbolic Logic 43 (3):508-520.
Σ1 compactness for next admissible sets.Judy Green - 1974 - Journal of Symbolic Logic 39 (1):105 - 116.
Nigel Cutland. Computabitity. An introduction to recursive function theory. Cambridge University Press, Cambridge etc. 1980, x + 251 pp. [REVIEW]H. B. Enderton - 1987 - Journal of Symbolic Logic 52 (1):292-293.
Nigel J. Cutland. Nonstandard measure theory and its applications. The bulletin of the London Mathematical Society, vol. 15 , pp. 529–589. [REVIEW]Joram Hirschfeld - 1989 - Journal of Symbolic Logic 54 (1):290-291.
Σ1-well-founded compactness.Nigel Cutland & Matt Kauffmann - 1980 - Annals of Mathematical Logic 18 (3):271-296.
Implicit definability and compactness in infinitary languages.Mihály Makkai - 1972 - Journal of Symbolic Logic 37 (1):201-202.
The Σ1-Provability Logic of HA.Mohammad Ardeshir & Mojtaba Mojtahedi - forthcoming - Journal of Symbolic Logic:1-18.

Analytics

Added to PP
2009-01-28

Downloads
37 (#616,885)

6 months
14 (#240,419)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Σ1-well-founded compactness.Nigel Cutland & Matt Kauffmann - 1980 - Annals of Mathematical Logic 18 (3):271-296.

Add more citations

References found in this work

No references found.

Add more references