No CrossRef data available.
Article contents
Ten modal models
Published online by Cambridge University Press: 12 March 2014
Extract
We consider the results of adding to a basic modal system T0 the axioms G1. CLpp; Pn. CLnpLn+1p; Bn. CpLnMp, where n ≧ 11, in all combinations. The method of Meredith's [7] will be extended to get models of these systems in lower predicate calculus (LPC) with a constant binary relation, U. Most of the results were already obtained in [1]–[6], though systems as in (i) and (ii) below were not investigated, except that S40 in (ii) was mentioned in [1]. However some repetition may be excused in view of the simplicity with which the results are obtained by the present method.
- Type
- Articles
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1964