Zur Charakterisierung von Theorien mit Syntaktisch Beschreibbarer Auswahlfunktion

Mathematical Logic Quarterly 14 (13-17):263-266 (1968)
  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,302

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

Zur Beweistheorie Von Sprachen Mit Unendlich Langen Formeln.Erwin Engeler - 1961 - Mathematical Logic Quarterly 7 (11-14):213-218.
Metatheoretische Eigenschaften Gewisser Klassen von Elementaren Theorien.Kurt Hauschild - 1968 - Mathematical Logic Quarterly 14 (13-17):205-244.
Eine Charakterisierung Gleichungskompakter Universeller Algebren.Günter H. Wenzel - 1973 - Mathematical Logic Quarterly 19 (14‐18):283-287.

Analytics

Added to PP
2013-11-24

Downloads
46 (#504,117)

6 months
8 (#390,329)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Zur Vergrösserung von Strukturen.Klaus-Peter Podewski - 1973 - Mathematical Logic Quarterly 19 (14‐18):265-270.

Add more citations

References found in this work

No references found.

Add more references