A converse of the Barwise completeness theorem

Journal of Symbolic Logic 38 (4):594-612 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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 unified completeness theorem for quantified modal logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
Eliminating “converse” from converse PDL.Giuseppe Giacomo - 1996 - Journal of Logic, Language and Information 5 (2):193-208.
Deductive completeness.Kosta Došen - 1996 - Bulletin of Symbolic Logic 2 (3):243-283.
Completeness theorems, representation theorems: what's the difference?David C. Makinson - unknown - Hommage À Wlodek: Philosophical Papers Dedicated to Wlodek Rabinowicz, Ed. Rønnow-Rasmussen Et Al. 2007.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.

Analytics

Added to PP
2009-01-28

Downloads
23 (#658,616)

6 months
4 (#797,377)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Rudimentary Recursion, Gentle Functions and Provident Sets.A. R. D. Mathias & N. J. Bowler - 2015 - Notre Dame Journal of Formal Logic 56 (1):3-60.

Add more citations

References found in this work

No references found.

Add more references