Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem

Mathematical Logic Quarterly 17 (1):285-289 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19710170133

Other Versions

No versions found

Links

PhilArchive



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

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

Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem.R. G. Jeroslow - 1971 - Mathematical Logic Quarterly 17 (1):285-289.
Jeroslow R. G.. Redundancies in the Hilbert–Bernays derivability conditions for Gödel's second incompleteness theorem.C. F. Kent - 1983 - Journal of Symbolic Logic 48 (3):875-876.
A note on the compactness theorem.R. R. Rockingham Gill - 1975 - Mathematical Logic Quarterly 21 (1):377-378.
A Proof of the Compactness Theorem.Kenneth J. Danhof - 1974 - Mathematical Logic Quarterly 20 (8-12):179-182.
A Note On The Compactness Theorem.R. Gill - 1975 - Mathematical Logic Quarterly 21 (1):377-378.
A Proof of the Compactness Theorem.Kenneth J. Danhof - 1974 - Mathematical Logic Quarterly 20 (8-12):179-182.
A Note on the Compactness Theorem in First Order Logic.George Weaver - 1980 - Mathematical Logic Quarterly 26 (7-9):111-113.
Maximality of linear continuous logic.Mahya Malekghasemi & Seyed-Mohammad Bagheri - 2018 - Mathematical Logic Quarterly 64 (3):185-191.
A Proof of the Compactness Theorem for Arithmetical Classes.H. Rasiowa - 1955 - Journal of Symbolic Logic 20 (1):78-78.

Analytics

Added to PP
2013-11-24

Downloads
36 (#634,047)

6 months
8 (#610,780)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Undecidable theories.Alfred Tarski - 1968 - Amsterdam,: North-Holland Pub. Co.. Edited by Andrzej Mostowski & Raphael M. Robinson.
On axiomatizability within a system.William Craig - 1953 - Journal of Symbolic Logic 18 (1):30-32.
Representability of recursively enumerable sets in formal theories.J. C. Shepherdson - 1961 - Archive for Mathematical Logic 5 (3-4):119-127.
Review: Alfred Tarski, Undecidable Theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.

Add more references