A Completeness Theorem in Modal Logic

@article{Kripke1959ACT,
  title={A Completeness Theorem in Modal Logic},
  author={S. Kripke},
  journal={J. Symb. Log.},
  year={1959},
  volume={24},
  pages={1-14}
}
  • S. Kripke
  • Published 1959
  • Mathematics, Computer Science
  • J. Symb. Log.
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, …, x m , y m , z m , … as well as a denumerably infinite list of n -adic predicate variables P n , Q n , R n , …, P m n , Q m n , R m n ,…; if n =0, an n -adic predicate variable is often called a “propositional variable.” A formula P n… Expand
828 Citations

Topics from this paper

Basic Propositional Calculus I
  • 60
A Note on Algebraic Semantics for S5 with Propositional Quantifiers
  • W. Holliday
  • Computer Science, Mathematics
  • Notre Dame J. Formal Log.
  • 2019
  • 6
  • Highly Influenced
Complete Additivity and Modal Incompleteness
  • 5
  • PDF
Random models of logical systems
  • 1
Logical consequence in modal logic. II. Some semantic systems for S4
  • 3
Logical atomism and modal logic
  • 8
Decidability of order-based modal logics
  • 13
  • PDF
Improved Decision Procedures for Pure Relevant Logic
  • 21
...
1
2
3
4
5
...

References

SHOWING 1-9 OF 9 REFERENCES
Symbolic Logic
  • 470
  • Highly Influential
  • PDF
A Theory Of Formal Deducibility
  • 73
  • Highly Influential
Logic for Mathematicians
  • 84
  • Highly Influential
Modality and Quantification in S5
  • A. Prior
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1956
  • 65
  • Highly Influential
Semantic Entailment And Formal Derivability
  • 273
  • Highly Influential
Mededelingen der Koninklijke Nederlandse Akademie van Wetenschappen, Afd Letterkunde, Nieuwe Reeks
  • 1955
Three Grades of Modal Involvment
  • 89
Introduction to Metamathematics
  • 3,853