Formal Theories are Acyclic

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (21-23):363-368 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19850312107

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

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

Formal Theories are Acyclic.K. S. Sarkaria - 1985 - Mathematical Logic Quarterly 31 (21‐23):363-368.
Monadic Elementary Formal Systems.Raymond M. Smullyan - 1961 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (6):81-83.
Relatively Complete Theories.D. W. H. Gillam - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):245-250.
Elementary Formal Systems for Hyperarithmetical Relations.Melvin Fitting - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (1-6):25-30.
Notes on Formal Theories of Truth.Andrea Cantini - 1989 - Zeitshrift für Mathematische Logik Und Grundlagen der Mathematik 35 (1):97--130.
Syllogistics of Some Theories.S. N. Furs - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):31-42.
A formal definition of the set of the logical connectors of pragmatics.Daniel R. Vanderveken - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):513-516.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
Representation of Models of Full theories.Andrew Adler - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (12):183-188.
A Class of ℵ0-Categorical Theories.Anand Pillay - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (25-30):411-418.

Analytics

Added to PP
2015-12-02

Downloads
22 (#166,999)

6 months
1 (#1,912,481)

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

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.

Add more references