Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-25T21:22:35.983Z Has data issue: false hasContentIssue false
  • English
  • Français

The decidability of certain intermediate propositional logics1

Published online by Cambridge University Press:  12 March 2014

C. G. Mckay
C. G. Mckay*
Affiliation:
University of East Anglia, England
Get access Rights & Permissions [Opens in a new window]

Extract

Acquaintance with [11] and [8] will be assumed. Let be the alphabet →, &, ν, ┐, (,), A1, A2, … where →(I), &(C), ν (D) and ┐(N) are called the connectives. The letters appearing in parentheses are the names of the connectives. A1, A2 … are the atoms.

Definition 1.1. A string S is an ICDN word iff there is a finite sequence of strings S1 … Sn = S such that for i, 1 ≤ i ≤ n, either S1 is an atom or S1 is one of the forms (S1→Sk), (S1 & Sk), (S1, ν Sk) or ┐S1,j, k ≤ i.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 33 , Issue 2 , 23 July 1968 , pp. 258 - 264
Copyright
Copyright © Association for Symbolic Logic 1968

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

Some of the results in this paper were announced in an Abstract presented to the Section on Mathematical Logic, at the Internptional Congress for Logic, Methodology and the Philosophy of Science, Amsterdam, August, 1967.

References

[1]Diego, A., Sur les algebres de Hilbert, Collection de logique mathématique, Série A, No. 21, Paris, 1966.Google Scholar
[2]Dummett, M., A prepositional calculus with denumerable matrix, this Journal, vol. 24 (1959), pp. 97–106.Google Scholar
[3]Harrop, R., On the existence of finite models and decision procedures, Proceedings of the Cambridge Philosophical Society, vol. 54 (1958), pp. 1–13.CrossRefGoogle Scholar
[4]Harrop, R., Some structure results for proportional calculi, this Journal, vol. 30 (1965), pp. 271–292.Google Scholar
[5]Horn, A., The separation theorem of intuitionist prepositional calculus, this Journal, vol. 27 (1962), pp. 391–399.Google Scholar
[6]Jankov, V. A., Some superconstructive prepositional calculi, Doklady Akademii Nauk SSSR, vol. 151 (1963), 796–798 = Soviet mathematics doklady, vol. 4 (1963), pp. 1103–1105.Google Scholar
[7]Kreisel, G. and Putnam, H., Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül, Archiv fúr mathematische Logik, vol. 3 (1957), pp. 74–78.CrossRefGoogle Scholar
[8]McKay, C. G., On finite logics, Indagationes mathematicae, vol. 70 (1967), pp. 363–365.CrossRefGoogle Scholar
[9]McKinsey, J. C. C. and Tarski, A., Some theorems about the sentential calculi of Lewis and Heyting, this Journal, vol. 13 (1948), pp. 1–15.Google Scholar
[10]Nishimura, I., On formulas of one variable in intuitionistic propositional calculus, this Journal, vol. 25 (1960), pp. 327–331.Google Scholar
[11]Troelstra, A. S., On intermediate prepositional logics, Indagationes mathematicae, vol. 27 (1965), pp. 141–152.CrossRefGoogle Scholar