On the decidability ofp′, p″ andP″

Archive for Mathematical Logic 17 (1-2):51-53 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,314

External links

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

Through your library

Similar books and articles

On the simplicity of the automorphism group ofP(ω)/fin.Sakaé Fuchino - 1992 - Archive for Mathematical Logic 31 (5):319-330.
On the n-uniqueness of types in rosy theories.Byunghan Kim - 2016 - Archive for Mathematical Logic 55 (5-6):677-686.
The prime number theorem and fragments ofP A.C. Cornaros & C. Dimitracopoulos - 1994 - Archive for Mathematical Logic 33 (4):265-281.
Axiomatisation and decidability off andp in cyclical time.Mark Reynolds - 1994 - Journal of Philosophical Logic 23 (2):197 - 224.
The de Jongh property for Basic Arithmetic.Mohammad Ardeshir & S. Mojtaba Mojtahedi - 2014 - Archive for Mathematical Logic 53 (7):881-895.
Anew relation‐combining theorem and its application.Zhi‐Wei Sun - 1992 - Mathematical Logic Quarterly 38 (1):209-212.
A note on end extensions.Ch Cornaros & C. Dimitracopoulos - 2000 - Archive for Mathematical Logic 39 (6):459-463.
Superstationary and ineffable n cardinals.Christopher C. Leary - 1990 - Archive for Mathematical Logic 29 (3):137-148.
Issues of decidability and tractability.Witold Marciszewski (ed.) - 2006 - Białystok: University of Białystok.

Analytics

Added to PP
2020-12-03

Downloads
4 (#1,822,973)

6 months
2 (#1,294,541)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Nevena Georgieva
Sofia University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references