On Complexity of Complete First-Order Theories

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (8-12):93-136 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19820280802

Other Versions

original Cooper, Glen R. (1982) "On Complexity of Complete First‐Order Theories". Mathematical Logic Quarterly 28(8‐12):93-136

Links

PhilArchive



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

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

On Complexity of Complete First‐Order Theories.Glen R. Cooper - 1982 - Mathematical Logic Quarterly 28 (8‐12):93-136.
A Note on Cut Elimination and Completeness in First Order Theories.Kenneth A. Bowen - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (8-11):173-176.
EQ and the First Order Functional Calculus.Nuel D. Belnap - 1960 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 6 (7-14):217-218.
The first‐order theory of the c‐degrees.Paddy Farrinoton - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (26‐29):437-446.
Cuninghame-Green R. A.. Single primitive ternary connectives for the 2-valued prepositional calculus. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 , pp. 206–207.Wheeler Roger F.. Complete prepositional connectives. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 185–198.Wheeler Roger F.. An asymptotic formula for the number of complete prepositional connectives. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 8 , pp. 1–4.Wheeler Roger F.. Complete connectives for the 3-vaIued prepositional calculus. Proceedings of the London Mathematical Society, ser. 3 vol. 16 , pp. 167–191. [REVIEW]Arto Salomaa - 1968 - Journal of Symbolic Logic 33 (1):127-128.
The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set.Egon Börger & Hans Kleine Büning - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):459-469.

Analytics

Added to PP
2015-12-02

Downloads
30 (#749,901)

6 months
2 (#1,685,557)

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