Thresholds for certainty and the modal logic S3

  • George Epstein
Logics For Artificial Intelligence
Part of the Lecture Notes in Computer Science book series (LNCS, volume 313)


This presents logics which use thresholds for certainty. These logics are related to the modal logic S3. The logic U is a weak logic of this kind. The logic UC is a strong logic of this kind. The logic UC has linear matrix, and hence is of interest in many applications, including fuzzy systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Epstein, G., "The underlying ground for hypothetical propositions," Logic in the Twentieth Century, Scientia (1983), 101–124.Google Scholar
  2. [2]
    Epstein, G. and Horn, A., "Logics which are characterized by subresiduated lattices," Zeitschr. f. math. Logik und Grundlagen d. Math., 22, (1976), 199–210.Google Scholar
  3. [3]
    Hacking, I., "What is strict implication?", J. Symb. Logic, 24 (1959), 97–106.Google Scholar
  4. [4]
    Lemmon, E.J., Meredith, C.A., Meredith, D., Prior, A.N. and Thomas, I., "Calculi of pure strict implication," (cyclostyled), Christchurch, Canterbury University College (1957).Google Scholar
  5. [5]
    Lewis, C.I. and Langford, C.H., Symbolic logic, N.Y., Dover Publications, 1932. Second edition, 1959.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • George Epstein
    • 1
  1. 1.Department of Computer ScienceUniversity of North Carolina at CharlotteCharlotteUSA

Personalised recommendations