Solution to a completeness problem of Lemmon and Scott

Notre Dame Journal of Formal Logic 16 (3):405-408 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093891804

Other Versions

No versions found

Links

PhilArchive



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

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

${\rm RMLC}$: solution to a problem left open by Lemmon.Dolph Ulrich - 1981 - Notre Dame Journal of Formal Logic 22 (2):187-189.
A simplification of the completeness proofs for Guaspari and Solovay's ${\rm R}$.Frans Voorbraak - 1989 - Notre Dame Journal of Formal Logic 31 (1):44-63.
In memoriam: Edward John Lemmon (1930---1966).Ivo Thomas - 1968 - Notre Dame Journal of Formal Logic 9 (1):1-3.
Solution to a problem of Chang and Lee.Richard Statman - 1980 - Notre Dame Journal of Formal Logic 21 (3):518-520.
Frans Voorbraak. A simplification of the completeness proofs for Guaspari and Solovay's R. Notre Dame journal of formal logic, vol. 31 , pp. 44–63. [REVIEW]Franco Montagna - 1993 - Journal of Symbolic Logic 58 (2):717-719.
Lennart Åqvist. Results concerning some modal systems that contain S2. The journal of symbolic logic, vol. 29 (1964), pp. 79–87. - E. J. Lemmon. Some results on finite axiomatlzability in modal logic. Notre Dame journal of formal logic, vol. 6 (1965), pp. 301–308. - E. J. Lemmon. A note on Halldén-incompleteness. Notre Dame journal of formal logic, vol. 7 no. 4 (for 1966, pub. 1968), pp. 296–300. [REVIEW]Lennart Aqvist & E. J. Lemmon - 1970 - Journal of Symbolic Logic 34 (4):648-649.
Lennart Åqvist. Results concerning some modal systems that contain S2. The journal of symbolic logic, vol. 29 (1964), pp. 79–87. - E. J. Lemmon. Some results on finite axiomatlzability in modal logic. Notre Dame journal of formal logic, vol. 6 (1965), pp. 301–308. - E. J. Lemmon. A note on Halldén-incompleteness. Notre Dame journal of formal logic, vol. 7 no. 4 (for 1966, pub. 1968), pp. 296–300. [REVIEW]M. J. Cresswell - 1970 - Journal of Symbolic Logic 34 (4):648-649.
The fibrational formulation of intuitionistic predicate logic ${\rm I}$: completeness according to Gödel, Kripke, and Läuchli. I.M. Makkai - 1993 - Notre Dame Journal of Formal Logic 34 (3):334-377.
The completeness of Stoic propositional logic.Ian Mueller - 1979 - Notre Dame Journal of Formal Logic 20 (1):201-215.
The completeness of combinatory logic with discriminators.John T. Kearns - 1973 - Notre Dame Journal of Formal Logic 14 (3):323-330.

Analytics

Added to PP
2010-08-24

Downloads
20 (#1,025,316)

6 months
8 (#544,556)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mathematical modal logic: A view of its evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.
The McKinsey axiom is not canonical.Robert Goldblatt - 1991 - Journal of Symbolic Logic 56 (2):554-562.
Elementary definability and completeness in general and positive modal logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.

Add more citations

References found in this work

No references found.

Add more references