On Complexity of Complete First‐Order Theories

Mathematical Logic Quarterly 28 (8‐12):93-136 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Cooper, Glen R. (1982) "On Complexity of Complete First-Order Theories". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28(8-12):93-136

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,063

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 translations of complete first order theories.Seyed Mohammad Bagheri - 2003 - Mathematical Logic Quarterly 49 (1):87-91.
Parallel Theories and Routine Revision in First-Order Logic.Gerold Stahl - 1987 - Mathematical Logic Quarterly 33 (5):457-459.
Relatively Complete Theories.D. W. H. Gillam - 1976 - Mathematical Logic Quarterly 22 (1):245-250.
Universally Complete Universal Theories.Peter Krauss - 1971 - Mathematical Logic Quarterly 17 (1):351-370.
Monotonicity and the Expressibility of NP Operators.Iain A. Stewart - 1994 - Mathematical Logic Quarterly 40 (1):132-140.
Complete second order spectra.Bruno Scarpellini - 1984 - Mathematical Logic Quarterly 30 (32‐34):509-524.
Complete Second Order Spectra.Bruno Scarpellini - 1984 - Mathematical Logic Quarterly 30 (32-34):509-524.
Nearly Model Complete Theories.David W. Kueker & Brian P. Turnquist - 1999 - Mathematical Logic Quarterly 45 (3):291-298.

Analytics

Added to PP
2013-12-01

Downloads
16 (#1,179,083)

6 months
4 (#1,232,162)

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

Mathematical logic.Joseph Robert Shoenfield - 1967 - Reading, Mass.,: Addison-Wesley.

Add more references