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 [Book Review]

Journal of Symbolic Logic 58 (2):717-719 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275234

Links

PhilArchive



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

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

A Simplification of the Completeness Proofs for Guaspari and Solovay's R.Frans Voorbraak - 1989 - Notre Dame Journal of Formal Logic 31 (1):44-63.
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.
A Simplification of a Completeness Proof of Guaspari and Solovay.Dick H. J. de Jongh - 1987 - Studia Logica 46 (2):187-192.
A simplification of a completeness proof of Guaspari and Solovay.Dick H. J. Jongh - 1987 - Studia Logica 46 (2):187 - 192.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
Some proofs of relative completeness in modal logic.M. J. Cresswell - 1968 - Notre Dame Journal of Formal Logic 9 (1):62-66.
On the proofs of arithmetical completeness for interpretability logic.Domenico Zambella - 1992 - Notre Dame Journal of Formal Logic 33 (4):542-551.
Quick completeness proofs for some logics of conditionals.John P. Burgess - 1981 - Notre Dame Journal of Formal Logic 22 (1):76-84.
Henkin style completeness proofs in theories lacking negation.John L. Pollock - 1971 - Notre Dame Journal of Formal Logic 12 (4):509-511.
A simplification of the logic of conditionals.E. J. Lowe - 1983 - Notre Dame Journal of Formal Logic 24 (3):357-366.
Why is conjunctive simplification invalid?Bruce E. R. Thompson - 1991 - Notre Dame Journal of Formal Logic 32 (2):248-254.
Some methods of formal proofs. III.Juliusz Reichbach - 1971 - Notre Dame Journal of Formal Logic 12 (4):479-482.
A simplification procedure for alternational normal schemata.John Riser - 1979 - Notre Dame Journal of Formal Logic 20 (4):765-767.
Partial Up and Down Logic.Jan O. M. Jaspars - 1995 - Notre Dame Journal of Formal Logic 36 (1):134-157.
Modal analysis of generalized Rosser sentences.Vítězslav Švejdar - 1983 - Journal of Symbolic Logic 48 (4):986-999.

Analytics

Added to PP
2013-11-03

Downloads
6 (#1,434,892)

6 months
1 (#1,516,429)

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

No references found.

Add more references