skip to main content
10.1145/1141277.1141286acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

A quantitative analysis of implicational paradoxes in classical mathematical logic

Published:23 April 2006Publication History

ABSTRACT

Classical mathematical logic includes a lot of "implicational paradoxes" as its logic theorems. On the other hand, relevant logics and strong relevant logics have rejected those implicational paradoxes as their logical theorems. This paper uses the property of strong relevance as the criterion to identify implicational paradoxes in logical theorems of classical mathematical logic, and count the number of logical theorem schemata of classical mathematical logic that do not satisfy the strong relevance. Our results quantitatively shows that classical mathematical logic is by far not a suitable logical basis for automated forward deduction.

References

  1. Anderson, A. R., and Jr., N. D. B. Entailment: The Logic of Relevance and Necessity, vol. 1. Princeton University Press, 1975.Google ScholarGoogle Scholar
  2. Anderson, A. R., Jr., N. D. B., and Dunn, J. M. Entailment: The Logic of Relevance and Necessity, vol. 2. Princeton University Press, 1992.Google ScholarGoogle Scholar
  3. Cheng, J. A Strong Relevant Logic Model of Epistemic Processes in Scientific Discovery. In Information Modelling and Knowledge Bases XI, E. Kawaguchi, H. Kangassalo, H. Jaakkola, and I. A. Hamid, Eds. IOS Press, Amsterdam, 2000, pp. 136--159.Google ScholarGoogle Scholar
  4. Cheng, J. Strong Relevant Logic as the Universal Basis of Various Applied Logics for Knowledge Representation and Reasoning. In 15th European-Japanese Conference on Information Modelling and Knowledge Bases (Tallinn, Estonia, May 16-19, 2005). Tallinn University of Technology, Tallinn, May 2005, pp. 227--287. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A quantitative analysis of implicational paradoxes in classical mathematical logic

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Published in

            cover image ACM Conferences
            SAC '06: Proceedings of the 2006 ACM symposium on Applied computing
            April 2006
            1967 pages
            ISBN:1595931082
            DOI:10.1145/1141277

            Copyright © 2006 ACM

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 23 April 2006

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate1,650of6,669submissions,25%
          • Article Metrics

            • Downloads (Last 12 months)1
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader