Some structure results for propositional calculi

1. Introduction . Since this paper is a written version of one presented as a survey lecture at a meeting of the Association for Symbolic Logic, its form and content have been essentially determined by the form and content of that lecture, and these latter were themselves considerably influenced by a deliberate attempt to avoid the lecture consisting essentially either of a catalogue of results in some fairly wide field or of the presentation of detailed proofs of a few particular results in a very limited field, with, in either case, a consequential serious limitation of the time available for discussion of the motivation for the results and of the connections between them. There is thus no attempt to cover, even in outline, the full range of topics which could reasonably fall within the scope of its title. The paper consists mainly of a general discussion of some results concerned with finite models of axiomatically defined calculi of propositional form, with particular reference to the occurrence of such models in proofs that certain propositional calculi are decidable. In addition, there is an account of some results concerned with the existence of undecidable propositional calculi and of others connected with the decidability or undecidability of certain structure problems which relate either to sets of propositional calculi or to different presentations of the same calculus.

[1]  R. Harrop.  A Relativization Procedure for Propositional Calculi, with an Application to a Generalized form of Post's Theorem , 1964 .

[2]  G. F. Rose.  Propositional calculus and realizability , 1953 .

[3]  A. Heyting.  Die formalen Regeln der intuitionistischen Logik , 1930 .

[4]  A. Tarski,et al.  On Closed Elements in Closure Algebras , 1946 .

[5]  Emil L. Post.  Introduction to a General Theory of Elementary Propositions , 1921 .

[6]  E. J. Lemmon.  Errata: An extension algebra and the modal system T , 1960, Notre Dame J. Formal Log..

[7]  J. C. C. McKinsey,et al.  A Solution of the Decision Problem for the Lewis systems S2 and S4, with an Application to Topology , 1941, J. Symb. Log..

[8]  Martin D. Davis,et al.  Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

[9]  Michael Dummett,et al.  A propositional calculus with denumerable matrix , 1959, Journal of Symbolic Logic (JSL).

[10]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[11]  S. C. Kleene.  Review: Stanislaw Jaskowski, Recherches sur le Systeme de la Logique Intuitioniste , 1937 .

[12]  R. A. Bull,et al.  Some results for implicational calculi , 1964, Journal of Symbolic Logic.

[13]  M. Gladstone.  Some ways of constructing a propositional calculus of any required degree of unsolvability , 1965 .

[14]  R. A. Bull.  A NOTE ON THE MODAL CALCULI S 4.2 AND S 4.3 , 1964 .

[15]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[16]  Timothy Smiley.  The Independence of Connectives , 1962, J. Symb. Log..

[17]  E. Lemmon,et al.  Modal Logics Between S 4 and S 5 , 1959 .

[18]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[19]  W. Singletary.  Recursive unsolvability of a complex of problems proposed by post , 1964 .

[20]  R. Harrop.  The Finite Model Property and Subsystems of Classical Propositional Calculus , 1959 .

[21]  T. Umezawa.  On intermediate many-valued logics , 1959 .

[22]  Mary Katherine Yntema,et al.  A detailed argument for the Post-Linial theorems , 1964, Notre Dame J. Formal Log..

[23]  Hilary Putnam,et al.  Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül , 1957, Arch. Math. Log..

[24]  R. A. Bull,et al.  An algebraic study of Diodorean modal systems , 1965, Journal of Symbolic Logic.

[25]  C. R. J. Clapham.  Finitely Presented Groups with Word Problems of Arbitrary Degrees of Insolubility , 1964 .

[26]  Helena Rasiowa.  O pewnym fragmencie implikacyjnego rachunku zdań , 1955 .

[27]  R. Harrop.  On the existence of finite models and decision procedures for propositional calculi , 1958, Mathematical Proceedings of the Cambridge Philosophical Society.

[28]  Soren Hallden,et al.  Results Concerning the Decision Problem of Lewis's Calculi S3 and S6 , 1949, J. Symb. Log..

[29]  Wilson E. Singletary.  A complex of problems proposed by Post , 1964 .

[30]  Schiller Joe Scroggs.  Extensions of the Lewis System S5 , 1951, J. Symb. Log..

[31]  Henryk Hiz.  Extendible Sentential Calculus , 1959, J. Symb. Log..

[32]  R. A. Bull.  A Class of Extensions of the Modal System S4 with the Finite Model Property , 1965 .

[33]  Alfred Tarski,et al.  Some theorems about the sentential calculi of Lewis and Heyting , 1948, The Journal of Symbolic Logic.

[34]  R. A. Bull,et al.  The implicational fragment of Dummett's LC , 1962, Journal of Symbolic Logic.

[35]  R. Harrop,et al.  On disjunctions and existential statements in intuitionistic systems of logic , 1956 .

[36]  William W. Boone,et al.  Partial results regarding word problems and recursively enumerable degrees of unsolvability , 1962 .

[37]  James Dugundji.  Note on a Property of Matrices for Lewis and Langford's Calculi of Propositions , 1940, J. Symb. Log..