Generalization of a result of Halldén

Notre Dame Journal of Formal Logic 16 (4):605-606 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

A note on Halldén-incompleteness.E. J. Lemmon - 1966 - Notre Dame Journal of Formal Logic 7 (4):296-300.
A generalization of the Gentzen Hauptsatz.Luis E. Sanchis - 1971 - Notre Dame Journal of Formal Logic 12 (4):499-504.
A generalization of combinatorial operators.Anna Silverstein - 1978 - Notre Dame Journal of Formal Logic 19 (4):639-645.
A simple generalization of Turing computability.William J. Thomas - 1979 - Notre Dame Journal of Formal Logic 20 (1):95-102.
A generalization of the adequacy theorem for the quasi-senses.Cinzia Bonotto - 1990 - Notre Dame Journal of Formal Logic 31 (4):560-575.
Halldén-completeness by gluing of Kripke frames.J. F. A. K. van Benthem & I. L. Humberstone - 1983 - Notre Dame Journal of Formal Logic 24 (4):426-430.

Analytics

Added to PP
2010-08-24

Downloads
19 (#190,912)

6 months
8 (#1,326,708)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

S7.Andrew David Irvine - 2013 - Journal of Applied Logic 11 (4):523-529.

Add more citations

References found in this work

No references found.

Add more references