Skip to main content

Part of the book series: Outstanding Contributions to Logic ((OCTR,volume 21))

Abstract

Strict/tolerant logic is a formally defined logic that has the same consequence relation as classical logic, though it differs from classical logic at the metaconsequence level. Specifically, it does not satisfy a cut rule. It has been proposed for use in work on theories of truth because it avoids some objectionable features arising from the use of classical logic. Here we are not interested in applications, but in the formal details themselves. We show that a wide range of logics have strict/tolerant counterparts, with the same consequence relations but differing at the metaconsequence level. Among these logics are Kleene’s \(\mathsf {K_3}\), Priest’s \({\mathsf {LP}}\), and first-degree entailment, FDE. The primary tool we use is the bilattice. But it is more than a tool, it seems to be the natural home for this kind of investigation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Arieli, O., & Avron, A. (1996). Reasoning with logical bilattices. Journal of Logic, Language, and Information, 5(1), 25–63.

    Article  Google Scholar 

  • Arieli, O., & Avron, A. (1998). The value of four values. Artificial Intelligence, 102, 97–141.

    Article  Google Scholar 

  • Asenjo, F. G. (1966). A calculus of antinomies. Notre Dame Journal of Formal Logic, 7, 103–105.

    Article  Google Scholar 

  • Avron, A. (1996). The structure of interlaced bilattices. Mathematical Structures in Computer Science, 6(3), 287–299.

    Article  Google Scholar 

  • Barrio, E. A., Pailos, F., & Szmuc, D. (2021) Hierarchies of Classical and Paraconsistent Logics. submitted for publication.

    Google Scholar 

  • Belnap, N. D, Jr. (1977). A useful four-valued logic. In J. M. Dunn & G. Epstein (Eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.

    Google Scholar 

  • Cobreros, P., et al. (2012). Tolerant, classical, strict. Journal of Philosophical Logic, 41(2), 347–385.

    Article  Google Scholar 

  • Ferguson, T. M. (2015). Cut-down operations on bilattices. In 2015 IEEE International Symposium on Multiple-Valued Logic (pp. 24–29).

    Google Scholar 

  • Fitting, M. C. (1989). Bilattices and the theory of truth. Journal of Philosophical Logic, 18, 225–256.

    Article  Google Scholar 

  • Fitting, M. C. (1990). Bilattices in logic programming. In G. Epstein (Ed.), The Twentieth International Symposium on Multiple-Valued Logic (pp. 238–246). IEEE.

    Google Scholar 

  • Fitting, M. C. (1991). Bilattices and the semantics of logic programming. Journal of Logic Programming, 11, 91–116.

    Article  Google Scholar 

  • Fitting, M. C. (1997). A theory of truth that prefers falsehood. Journal of Philosophical Logic, 26, 477–500.

    Article  Google Scholar 

  • Fitting, M. C. (2006). Bilattices are nice things. In T. Bolander, V. Hendricks, & S. A. Pederrsen (Eds.), Self-Reference (pp. 53–77). Center for the Study of Language and Information.

    Google Scholar 

  • Frankowski, S. (2004a). Formalization of a plausible inference. Bulletin of the Section of Logic, 33, 41–52.

    Google Scholar 

  • Frankowski, S. (2004b). P-consequence versus q-consequence. Bulletin of the Section of Logic, 33, 197–207.

    Google Scholar 

  • Gargov, G. (1999). Knowledge, uncertaity and ignorance in logic: Bilattices and beyond. Journal of Applied Non-Classical Logics, 9(2–3), 195–283.

    Article  Google Scholar 

  • Ginsberg, M. L. (1988). Multivalued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4, 265–316.

    Article  Google Scholar 

  • Ginsberg, M. L. (1990). Bilattices and modal operators. Journal of Logic and Computation, 1(1), 41–69.

    Article  Google Scholar 

  • Kleene, S. C. (1938). On notation for ordinal numbers. Journal of Symbolic Logic, 3, 150–155.

    Article  Google Scholar 

  • Kleene, S. C. (1950). Introduction to Metamathematics. Princeton, NJ: D. Van Nostrand.

    Google Scholar 

  • Leitgeb, H. (1999). Truth and the Liar in De Morgan-valued models. Notre Dame Journal of Formal Logic, 40(4), 496–514.

    Article  Google Scholar 

  • Malinowski, G. (1990). Q-consequence operation. Reports on Mathematical Logic, 24, 49–59.

    Google Scholar 

  • Malinowski, Grzegorz. (2002). Referential and Inferential Many-Valuedness. In W. A. Carnielli, M. E. Coniglio, & I. M. L. DOttaviano (Eds.), Paraconsistency, the Logical Way to the Inconsistent (Vol. 228, pp. 341–352). Lecture Notes in Pure and Applied Mathematics 228. Marcel Dekker.

    Google Scholar 

  • Malinowski, G. (2007). That p + q = c(onsequence). Bulletin of the Section of Logic, 36(1/2), 7–19.

    Google Scholar 

  • Priest, G. (1979). The logic of paradox. Journal of Philosophical Logic, 8(1), 219–241.

    Article  Google Scholar 

  • Priest, G. (2008). An Introduction to Non-Classical Logic; From If to Is (2nd ed.). Cambridge: Cambridge University Press.

    Google Scholar 

  • Shramko, Y., & Wansing, H. (2005). Some useful 16-valued logics: how a computer network should think. Journal of Philosophical Logic, 34, 121–153.

    Article  Google Scholar 

  • Shramko, Y., & Wansing, H. (2011). Truth and falsehood: an inquiry into generalized logical values. In Trends in Logic (Vol. 36). Springer.

    Google Scholar 

  • Szmuc, D. (2018). Track-down operations on bilattices. In R. Wille & M. Lukac (Eds.), Proceedings of the 48th IEEE International Symposium on Multiple-Valued Logic, Los Alamitos, California (pp. 74–79).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Melvin Fitting .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Fitting, M. (2021). The Strict/Tolerant Idea and Bilattices. In: Arieli, O., Zamansky, A. (eds) Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Outstanding Contributions to Logic, vol 21. Springer, Cham. https://doi.org/10.1007/978-3-030-71258-7_8

Download citation

Publish with us

Policies and ethics