Skip to main content

FDE: A Logic of Clutters

  • Chapter
  • First Online:
Paraconsistency: Logic and Applications

Part of the book series: Logic, Epistemology, and the Unity of Science ((LEUS,volume 26))

Abstract

We uncover a ‘naturally occurring’ first degree system, AL of Articular Logic that is both relevant and paraconsistent. The principal semantic innovation is an informationally articulated, but nevertheless entirely classical representation of wffs as clutters (Clutters are also referred to as simple hypergraphs in some contexts.) on the power set of a set of possible states. The principal methodological novelty is the general observation that distinct classical representations of wffs can be selected and combined with redeployments of classical inference to accommodate particular inferential requirements such as paraconsistency and relevance.

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

Notes

  1. 1.

    A hypergraph on a set is a collection of collections of objects from that set whose elements are called the vertices of the hypergraph. The 3-harmonic hypergraph is a hypergraph on the premise set. Members of the hypergraph are called edges. A hypergraph is n-harmonic for any natural number n if n + 1 is the least number of edges whose intersection is non-empty.

  2. 2.

    Every n − tuple of edges has a common vertex.

  3. 3.

    A hypergraph H is n-uncolourable if the width of the narrowest colouring of the set which will not result in monochromatic cells is greater that n; else it is n − colourable. The least n such that H is n − colourable is called the chromatic number of the set.

  4. 4.

    By \(\overline{a}\) we mean the set theoretic complement of a.

  5. 5.

    H so far has been used to denote clutters. However, when there is no danger of confusion, we refer to hypergraph by it as well.

  6. 6.

    The subscript suggests that the binary axioms belong to AL 1.

References

  • Anderson, A.R., and N.D. Belnap. 1961. Tautological entailments. Philosophical Studies 13: 9–24.

    Article  Google Scholar 

  • Chennings, and J. Sahasrabudhe. 2011. A new idiom for the study of entailment. Logica Universalis 5(1): 101–113.

    Google Scholar 

  • Goldblatt, R. 1974. Semantic analysis of orthologic. Journal of Philosophical Logic 3: 19–35.

    Article  Google Scholar 

  • Jennings, R.E., and Y. Chen. 2010. Articular models for first degree paraconsistent systems. forthcoming.

    Google Scholar 

  • Jennings, R.E., and Y. Chen. 2011. Necessity and materiality. forthcoming.

    Google Scholar 

  • Jennings, R.E., and D. Nicholson. 2007. An axiomatization of family resemblance. Journal of Applied Logic 5: 577–585.

    Article  Google Scholar 

  • Jennings, R.E., and P.K. Schotch. 1984. The preservation of coherence. Studia Logica 43: 1–2.

    Article  Google Scholar 

  • Priest, G. 1989. The logic of paradox. Journal of Philosophical Logic 8: 219–241.

    Google Scholar 

  • Schotch, P.K., and R.E. Jennings. 1980. Inference and necessity. Journal of Philosophical Logic 9: 327–340.

    Article  Google Scholar 

  • Scott, D. 1974. Completeness and axiomatizability in many-valued logic. In Proceedings of symposia in pure mathematics, 411–436. Providence: AMS.

    Google Scholar 

  • Tarski, A. 1994. The semantical concept of truth and the foundations of semantics. Philosophy and Phenomenological Research 4: 341–375.

    Article  Google Scholar 

Download references

Acknowledgements

The research presented in this paper is supported by SSHRC research grant # 410-2008-2330. We would like to express our thanks to Professor J. Michael Dunn for his stimulating correspondence and to Bryson Brown, Julian Sahasrabudhe and Andrew Withy for their valuable observations.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. E. Jennings .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht.

About this chapter

Cite this chapter

Jennings, R.E., Chen, Y. (2013). FDE: A Logic of Clutters. In: Tanaka, K., Berto, F., Mares, E., Paoli, F. (eds) Paraconsistency: Logic and Applications. Logic, Epistemology, and the Unity of Science, vol 26. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-4438-7_10

Download citation

Publish with us

Policies and ethics