Advertisement

Many-Valued Logics

Part of the Synthese Library book series (SYLI, volume 149)

Abstract

I shall endeavour to cover as many branches of many-valued logic and as much of the work done in these branches as space permits. Much must, of course, be omitted, and I should therefore like to refer to an excellent bibliography of many-valued logics by Nicholas Rescher in his book (Many-Valued Logic, McGraw Hill 51893,1969). This only covers publications to 1965, so I have given a few references (at the end of the text) to papers published since that date.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. A complete list of publications on many-valued logics since 1965 would, of course, be far too long to he given here, but a few examples of the publications referred to in the text are given. Even a complete list of these publications would be somewhat lengthy and the omission of a paper from this list does not imply that it is considered to be un¬important. A few papers published before 1965 are included as they have considerable relevance to topics from many-valued logics discussed above, although they concern directly only 2-valued logic and are therefore omitted from Reseller’s bibliography.Google Scholar
  2. [1]
    R. O. Davies, ‘Two Theorems on Essential Variables’, J. London Math. Soc. 41 (1966), 333–335.CrossRefGoogle Scholar
  3. [2]
    R. O. Davies, On n-valued Sheffer Functions, Z. Math. Logik 25 (1979), 293–298.CrossRefGoogle Scholar
  4. [3]
    K. Gödel, ‘Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I’, Monatshefte Mathematik und Physik 38 (1931), 173–198.CrossRefGoogle Scholar
  5. [4]
    K. Gödel, ‘The Consistency of the Axiom of Choice and of the Generalised Continuum Hypothesis with the Axioms of Set Theory’, Ann. Math. Studies 3, Princeton, 1940.Google Scholar
  6. [5]
    L. Henkin, The Completeness of the First Order Functional Calculus’, J. Symbolic Logic 14 (1949), 159–166.CrossRefGoogle Scholar
  7. [6]
    L. Kalmár, ‘Über die Axiomatisierbarkeit des Aussagenkalküls, Acta scientarum mathematicarum (Szeged)’, 7 (1935), 222–243.Google Scholar
  8. [7]
    S. McCall and R. K. Meyer, ‘Pure 3-Valued Lukasiewiczian Implication’, J. Symbolic Logic 31 (1966), 399–405.CrossRefGoogle Scholar
  9. [8]
    J. C. Munzio, ‘A Decision Process for 3-Valued Sheffer Functions, I and II’, Z. Math. Logik 16 (1970), 271–280 and 17 (1971), 97–114.Google Scholar
  10. [9]
    J. C. Munzio, ‘A Decision Process for 3-Valued Sheffer Functions, I and II’, Z. Math. Logik 16 (1970), 271–280 and 17 (1971), 97–114.CrossRefGoogle Scholar
  11. [10]
    A. Rose, ‘Formalisations de certains calculs propositionnels polyvalents à fonc- teurs variables au cas ou cerùtains valeurs sont surdésignées’, Comptes rendus (Paris) 262 (1966), 1233–1235.Google Scholar
  12. [11]
    A. Rose, ‘A Formalisation of the 0-valued Lukasiewicz Propositional Calculus with Variable Functors’, Z. Math. Logik 13 (1967), 289–292.CrossRefGoogle Scholar
  13. [12]
    A. Rose, Formalisations of Some 0 -Valued Lukasiewicz Propositional Calculi, Proceedings of the Summer School in Logic, (Leeds, 1967 ), pp. 269–271 ( Springer, Berlin, 1968 ).Google Scholar
  14. [13]
    A. Rose, ‘Locally Full 0-Valued Propositional Calculi’, Z. Math. Logik 18 (1972), 217–226.CrossRefGoogle Scholar
  15. [14]
    J. B. Rosser, Simplified Independence Proofs, Boolean Valued Models of Set Theory, Academic Press, New York and London, 1969.Google Scholar
  16. [15]
    G. Rousseau, ‘Completeness in Finite Algebras with a Single Operation’, Proc. Am. Math. Soc. 18 (1967), 1009–1013.CrossRefGoogle Scholar
  17. [16]
    D. Scott and R. Solovay, ‘Boolean Valued Models for Set Theory’, Proceedings of the American Mathematical Society Summer Inst. Axiomatic Set Theory 1967, Univ. of California, Los Angeles, Proc. Symp. Pure Math. 13 (1969).Google Scholar
  18. [17]
    D. J. Shoesmith, Ph. D. Dissertation, University of Cambridge, 1962.Google Scholar
  19. [18]
    S. Watanebe, Ph. D. Thesis, University of Manchester, 1974.Google Scholar
  20. [19]
    R. Wójcicki, ‘The Logics Stronger Than Lukasiewicz’s 3-Valued Sentential Calculus — the Notion of Degree of Maximality Versus the Notion of Degree of Completeness’, Studia Logica 33 (1974), 201–214.CrossRefGoogle Scholar

Copyright information

© D. Reidel Publishing Company 1981

Authors and Affiliations

  • A. Rose
    • 1
  1. 1.Dept. of MathematicsNattinghamUK

Personalised recommendations