Skip to main content
×
Home
    • Aa
    • Aa

A completeness theorem in modal logic1

Abstract

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.

Copyright
Footnotes
Hide All

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.

Footnotes
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 17 *
Loading metrics...

Abstract views

Total abstract views: 183 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 26th May 2017. This data will be updated every 24 hours.