Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Home
Hostname: page-component-7f7b94f6bd-82ts8 Total loading time: 0.199 Render date: 2022-06-29T15:39:15.662Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true
  • English
The Journal of Symbolic Logic The Journal of Symbolic Logic

Article contents

A completeness theorem in modal logic1

Published online by Cambridge University Press:  12 March 2014

Saul A. Kripke
Get access Rights & Permissions[Opens in a new window]

Extract

The present paper attempts to state and prove a completeness theorem for the system S5 of [1], supplemented by first-order quantifiers and the sign of equality. We assume that we possess a denumerably infinite list of individual variables a, b, c, …, x, y, z, …, xm, ym, zm, … as well as a denumerably infinite list of n-adic predicate variables Pn, Qn, Rn, …, Pmn, Qmn, Rmn,…; if n=0, an n-adic predicate variable is often called a “propositional variable.” A formula Pn(x1, …,xn) is an n-adic prime formula; often the superscript will be omitted if such an omission does not sacrifice clarity.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 24 , Issue 1 , March 1959 , pp. 1 - 14
Copyright
Copyright © Association for Symbolic Logic 1959

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

My thanks to the referee and to Professor H. B. Curry for their helpful comments on this paper and their careful reading of it. I must express an added debt of gratitude to Curry; without his constant encouragement of my research, publication of these results might have been delayed for years.

References

[1]Lewis, C. I. and Langford, C. H., Symbolic logic, Century Company, 1932.Google Scholar
[2]Rosser, J. B., Logic for mathematicians, McGraw-Hill, 1953.Google Scholar
[3]Carnap, Rudolf, Introduction to semantics, Harvard University Press, 1942.Google Scholar
[4]Beth, E. W., Semantic entailment and formal derivability, Mededelingen der Koninklijke Nederlandse Akademie van Wetenschappen, Ajd Letterkunde, Nieuwe Reeks, Deel 18, no. 13, pp. 309–342 (1955).Google Scholar
[5]Quine, W. V., Three grades of modal involvement, Proceedings of the XIth International Congress of Philosophy, Vol. XIV, pp. 65–81.Google Scholar
[6]Prior, A. N., Modality and quantification in S5, this Journal, Vol. 21 (1956), pp. 60–62.Google Scholar
[7]Kleene, S. C., Introduction to metamathematics, Van Nostrana, 1952.Google Scholar
[8]Curry, H. B., A theory of formal deducibility, Notre Dame Mathematical Lectures, no. 6, 1950.Google Scholar
427
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

A completeness theorem in modal logic1
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

A completeness theorem in modal logic1
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

A completeness theorem in modal logic1
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *