Skip to main content

The Number of Logical Values

  • Chapter
  • First Online:
Graham Priest on Dialetheism and Paraconsistency

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

  • 469 Accesses

Abstract

We argue that formal logical systems are four-valued, these four values being determined by the four deductive outcomes: A without ~A, ~A without A, neither A nor ~A, and both A and ~A. We further argue that such systems ought to be three-valued, as any contradiction, A and ~A, should be removed by reconceptualisation of the concepts captured by the system. We follow by considering suitable conditions for the removal of the third value, neither A nor ~A, yielding a classically valued system. We then consider what values are appropriate for the meta-theory, arguing that it should be three-valued, but reducible to the two classical values upon the decidability of the object system.

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.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

  • Anderson, A. R., & Belnap, N. D. Jr. (1975). Entailment: The logic of relevance and necessity (Vol. 1, Princeton U.P.).

    Google Scholar 

  • Brady, R. T. (1982). Completeness proofs for the systems RM3 and BN4. Logique et Analyse, 25, 9–32.

    Google Scholar 

  • Brady, R. T. (1996). Relevant implication and the case for a weaker logic. Journal of Philosophical Logic (Vol. 25, pp. 151–183).

    Google Scholar 

  • Brady, R. T. (2006). Universal Logic, CSLI Publs, Stanford.

    Google Scholar 

  • Brady, R. T. (2007). Entailment: A Blueprint. In J.-Y. Beziau, W. Carnielli and D. Gabbay (eds.), Handbook of Paraconsistent Logic, College Publications, King’s College, London (pp. 127–151).

    Google Scholar 

  • Brady, R. T. (2010). Extending metacompleteness to systems with classical formulae. Australasian Journal of Logic, 8, 9–30.

    Google Scholar 

  • Brady, R. T. (2012). The consistency of arithmetic, based on a logic of meaning containment. Logique et Analyse, 55, 353–383.

    Google Scholar 

  • Brady, R. T. (2014). The simple consistency of Naïve set theory using meta valuations. Journal of Philosophical Logic, 43, 261–281.

    Article  Google Scholar 

  • Brady, R. T. (2015a). The use of definitions and their logical representation in paradox derivation. In Presented to the 5th World Congress on Universal Logic, University of Istanbul, Istanbul, Turkey, June 25–30, forthcoming in Synthese.

    Google Scholar 

  • Brady, R. T. (2015b). Logic—the big picture. in J.-Y. Beziau, M. Chakraborty and S. Dutta (eds), New Directions in Paraconsistent Logic, Springer, New Delhi, pp. 353–373.

    Google Scholar 

  • Brady, R. T. (2017). Some concerns regarding ternary-relation semantics and truth-theoretic semantics in general. The IfCoLog Journal of Logics and their Applications, 4, 755–781.

    Google Scholar 

  • Brady, R. T. (2019). On the law of excluded middle. In Ultralogic as Universal?, The Sylvan Jungle, ed. by Zach Weber, Springer, Switzerland, (Vol. 4, pp. 161-183).

    Google Scholar 

  • Brady, R. T. & Meinander, A. (2013). Distribution in the logic of meaning containment and in quantum mechanics. In Paraconsistency: Logic and Applications, ed. by Koji Tanaka, Francesco Berto, Edwin Mares and Francesco Paoli, Springer Publishing, Dordrecht (pp. 223–255).

    Google Scholar 

  • Dugundji, J. (1940). Note on a property of matrices for Lewis and Langford’s calculi of propositions. The Journal of Symbolic Logic, 5, 150–151.

    Article  Google Scholar 

  • Goddard, L., & Routley, R. (1973). The logic of significance and context. Edinburgh: Scottish Academic Press.

    Google Scholar 

  • Henkin, L. (1949). The completeness of first-order functional calculus. The Journal of Symbolic Logic, 14, 159–166.

    Article  Google Scholar 

  • Körner, S. (1960). The philosophy of mathematics. London: Hutchinson.

    Google Scholar 

  • Meyer, R. K. (1976). Metacompleteness. Notre Dame Journal of Formal Logic, 17, 501–516.

    Article  Google Scholar 

  • Routley, R., Meyer, R. K., Plumwood, V., & Brady, R. T. (1982). Relevant logics and their rivals (Vol. 1, Ridgeview, Atascadero, California).

    Google Scholar 

  • Shramko, Y., & Wansing, H. (2011). Truth and falsity: An inquiry into generalized logical values. Dordrecht: Springer.

    Google Scholar 

  • Slaney, J. K. (1984). A metacompleteness theorem for contraction-free relevant logics. Studia Logica, 43, 159–168.

    Article  Google Scholar 

  • Slaney, J. K. (1987). Reduced models for relevant logics without WI. Notre Dame Journal of Formal Logic, 28, 395–407.

    Article  Google Scholar 

Download references

Acknowledgments

I would like to thank the referee for a number of incisive comments on this paper. I would also like to thank the members of the University of Melbourne Logic Seminar for their interesting and pertinent discussion of this paper and, in particular, for pointing out a glaring error of reference. I would also like to thank Thomas Ferguson for encouraging me to continue with this paper, even after I felt that I could not complete it in a reasonable time.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ross T. Brady .

Editor information

Editors and Affiliations

Appendix

Appendix

The required axiomatization of MCQ is set out below:

MC.

Primitives: ~, &, ∨, → .

Axioms.

  1. 1.

    A → A.

  2. 2.

    A&B → A.

  3. 3.

    A&B → B.

  4. 4.

    (A → B)&(A → C) → .A → B&C.

  5. 5.

    A → A∨B.

  6. 6.

    B → A∨B.

  7. 7.

    (A → C)&(B → C) → .A∨B → C.

  8. 8.

    ~~A → A.

  9. 9.

    A → ~B → .B → ~A.

  10. 10.

    (A → B)&(B → C) → .A → C.

Rules.

  1. 1.

    A, A → B ⇒ B.

  2. 2.

    A, B ⇒ A&B.

  3. 3.

    A → B, C → D ⇒ B → C → .A → D.

Metarule.

  1. 1.

    If A, B ⇒ C then D∨A, D∨B ⇒ D∨C.

We now add the quantifiers to yield MCQ. As in earlier presentations, we separate free and bound variables to simplify the conditions on the axioms.

MCQ.

Primitives: ∀, ∃,

a, b, c, … (free variables)

x, y, z, … (bound variables)

  • Axioms.

  1. 1.

    ∀xA → Aa/x.

  2. 2.

    ∀x(A → B) → .A → ∀xB.

  3. 3.

    Aa/x → ∃xA.

  4. 4.

    ∀x(A → B) → . ∃xA → B.

Rule.

  1. 1.

    Aa/x ⇒ ∀xA, where a does not occur in A.

Metarule.

  1. 1.

    If A, B ⇒ C then A, ∃xB ⇒ ∃xC,

where QR1 does not generalize on any free variable in A or in B. The same applies to the premises A and B of the metarule MR1 of MC.

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Brady, R.T. (2019). The Number of Logical Values. In: Başkent, C., Ferguson, T. (eds) Graham Priest on Dialetheism and Paraconsistency. Outstanding Contributions to Logic, vol 18. Springer, Cham. https://doi.org/10.1007/978-3-030-25365-3_3

Download citation

Publish with us

Policies and ethics