Skip to main content

A Model-Theoretic Analysis of Fidel-Structures for mbC

  • Chapter
  • First Online:

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

Abstract

In this paper, the class of Fidel-structures for the paraconsistent logic mbC is studied from the point of view of Model Theory and Category Theory. The basic point is that Fidel-structures for mbC (or mbC-structures) can be seen as first-order structures over the signature of Boolean algebras expanded by two binary predicate symbols N (for negation) and O (for the consistency connective) satisfying certain Horn sentences. This perspective allows us to consider notions and results from Model Theory in order to analyze the class of mbC-structures. Thus, substructures, union of chains, direct products, direct limits, congruences and quotient structures can be analyzed under this perspective. In particular, a Birkhoff-like representation theorem for mbC-structures as subdirect products in terms of subdirectly irreducible mbC-structures is obtained by adapting a general result for first-order structures due to Caicedo. Moreover, a characterization of all the subdirectly irreducible mbC-structures is also given. An alternative decomposition theorem is obtained by using the notions of weak substructure and weak isomorphism considered by Fidel for \(C_n\)-structures.

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

Buying options

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

Learn about institutional subscriptions

Notes

  1. 1.

    For a good introductory article on Paraconsistency see Priest et al. (2016) and the references therein.

  2. 2.

    The general case in which this conditions is dropped is briefly analyzed by Priest in (2014).

  3. 3.

    For general notions on Model Theory and Category Theory the reader can consult Chang and Keisler (2012) and Mac Lane (1978), respectively.

  4. 4.

    In difference with several authors, we admit the trivial one-element Boolean algebra, see Remark 10.39.

  5. 5.

    This means that \(A \subseteq A'\), \(\mathbf{0}^{\mathcal {A}}=\mathbf{0}^{\mathcal {A}'}\), \(\mathbf{1}^{\mathcal {A}}=\mathbf{1}^{\mathcal {A}'}\) and, for every \(a,b \in A\): \(a \#^\mathcal {A}b = a \#^{\mathcal {A}'}b\) and \({-}^\mathcal {A}a= {-}^{\mathcal {A}'}a\) for \(\# \in \{\sqcap , \sqcup \}\). Note that we write \(s^\mathcal {A}\) instead of \(s^\mathcal {E}\) when s correspond to a symbol of the subsignature \(\Theta _{BA}\) of \(\Theta \).

  6. 6.

    Since in Model Theory the equality predicate \(\approx \) is considered as a predicate symbol which is always interpreted as the standard equality, the injectivity of an embedding is a consequence of the definition.

  7. 7.

    The propositional consequence relation \(\Vdash _\mathbf{K}^{\mathbf{mbC}}\) generated by a class K of mbC-structures should not be confused with the first-order consequence relation \(\models _\mathbf{K}\) defined over first-order \(\Theta \)-sentences as follows: \(\Upsilon \models _\mathbf{K} \sigma \) if, for every \(\mathcal {E}\in \mathbf{K}\), it holds: \(\mathcal {E}\models \sigma \) whenever \(\mathcal {E}\models \varrho \) for every \(\varrho \in \Upsilon \).

  8. 8.

    In order to define \(\bar{v}\) by induction on the complexity of \(\gamma \), the complexity measure on \(For(\Sigma )\) must be defined in a way such that \({\circ }\beta \) has a complexity degree strictly greater than that of \(\lnot \beta \), for every \(\beta \in For(\Sigma )\).

  9. 9.

    That is, \(\theta \) is an equivalence relation which is preserved by the operations of the Boolean algebra \(\mathcal{A}\).

  10. 10.

    Observe that, in particular, \(h:\mathcal {A}\rightarrow \mathcal {A}'\) is a Boolean homomorphism.

  11. 11.

    In addition, also as a consequence of Chang and Keisler (2012, Proposition 6.2.2), it follows that the class F mbC is closed under reduced products; in particular, it is closed under ultraproducts.

  12. 12.

    As usual, if I and Z are two sets, then \(Z^I\) denotes the set of mappings from I to Z.

  13. 13.

    Such homomorphisms are called isomorphisms in Fidel (1977, Definition 6).

  14. 14.

    Observe that the interpretation of function symbols and constants is well-defined since f is a homomorphism of first-order structures, hence it is an algebraic homomorphism.

References

  • Avron, A., & Lev, I. (2001). Canonical propositional Gentzen-type systems. In: R. Gore, A. Leitsch, & T. Nipkow (Eds.), Proceedings of the 1st International Joint Conference on Automated Reasoning (IJCAR 2001), LNAI (Vol. 2083, pp. 529–544). Springer.

    Google Scholar 

  • Avron, A. (2007). Non-deterministic semantics for logics with a consistency operator. Journal of Approximate Reasoning, 45, 271–287.

    Article  Google Scholar 

  • Birkhoff, G. (1935). On the structure of abstract algebras. Proceedings of the Cambridge Philosophical Society, 31, 433–454.

    Article  Google Scholar 

  • Birkhoff, G. (1944). Subdirect unions in universal algebra. Bulletin of the American Mathematical Society, 50(10), 764–768.

    Article  Google Scholar 

  • Blok, W. J., & Pigozzi, D. (1989). Algebraizable logics. In Memoirs of the American mathematical society (Vol. 77(396)). American Mathematical Society, Providence, USA.

    Google Scholar 

  • Caicedo, X. (1981). The subdirect decomposition theorem for classes of structures closed under direct limits. Journal of the Australian Mathematical Society, 30, 171–179.

    Article  Google Scholar 

  • Carnielli, W. A. (1990). Many-valued logics and plausible reasoning. In G. Epstein (Ed.,) Proceedings of the Twentieth International Symposium on Multiple-Valued Logic, Charlotte, NC, USA (pp. 328–335). The IEEE Computer Society Press.

    Google Scholar 

  • Carnielli, W. A., & Coniglio, M. E. (2014). Swap structures for LFIs. CLE e-Prints, 14(1).

    Google Scholar 

  • Carnielli, W. A., & Coniglio, M. E. (2016). Paraconsistent logic: Consistency, contradiction and negation. In Logic, epistemology, and the unity of science series (Vol. 40) Springer.

    Google Scholar 

  • Carnielli, W. A., Coniglio, M. E., & Marcos, J. (2007). Logics of formal inconsistency. In D. M. Gabbay & F. Guenthner (Eds.), Handbook of philosophical logic) (2nd ed., Vol. 14, pp. 1–93). Springer.

    Google Scholar 

  • Carnielli, W. A., Coniglio, M. E., Podiacki, R., & Rodrigues, T. (2014). On the way to a wider model theory: Completeness theorems for first-order logics of formal inconsistency. The Review of Symbolic Logic, 7(3), 548–578.

    Article  Google Scholar 

  • Carnielli, W. A., & Marcos, J. (2002). A taxonomy of C-systems. In W. A. Carnielli, M. E. Coniglio, & I. M. L. D’Ottaviano (Eds.), Paraconsistency: The logical way to the inconsistent (pp. 1–94). Proceedings of the 2nd World Congress on Paraconsistency (WCP 2000), Lecture Notes in Pure and Applied Mathematics (Vol. 228). New York: Marcel Dekker.

    Google Scholar 

  • Chang, C. C., & Keisler, H. J. (2012). Model theory (3rd ed.). In Dover books on mathematics series. Dover Publications.

    Google Scholar 

  • Coniglio, M. E., Figallo-Orellano, A., & Golzio, A. C. (2017). Non-deterministic algebraization of logics by swap structures. Logic Journal of the IGPL, to appear. Preprint available at arXiv:1708.08499v1 [math.LO].

  • da Costa, N. C. A. (1993). Sistemas Formais Inconsistentes (Inconsistent Formal Systems, in Portuguese). Habilitation thesis, Universidade Federal do Paraná, Curitiba, Brazil, 1963. Republished by Editora UFPR, Curitiba, Brazil.

    Google Scholar 

  • da Costa, N. C. A., & Alves, E. H. (1976). Une sémantique pour le calcul \({C}_1\) (in French). Comptes Rendus de l’Académie de Sciences de Paris (A-B), 283, 729–731.

    Google Scholar 

  • da Costa, N. C. A., & Alves, E. H. (1977). A semantical analysis of the calculi \({C}_n\). Notre Dame Journal of Formal Logic, 18(4), 621–630.

    Article  Google Scholar 

  • Ferguson, T. M. (2018). The Keisler-Shelah theorem for QmbC through semantical atomization. Logic Journal of the IGPL, to appear.

    Google Scholar 

  • Fidel, M. M. (1977). The decidability of the calculi \(C_n\). Reports on Mathematical Logic, 8, 31–40.

    Google Scholar 

  • Jaśkowski, S. (1998, July). Rachunek zdań dla systemów dedukcyjnych sprzecznych (in Polish). Studia Societatis Scientiarun Torunesis – Sectio A, I(5), 57–77. Translated to English as “A propositional calculus for inconsistent deductive systems”. Logic and Logical Philosophy, 7, 35–56, 1999. Proceedings of the Stanisław Jaśkowski’s Memorial Symposium, held in Toruń, Poland, July 1998.

    Google Scholar 

  • Mac Lane, S. (1978). Categories for the working mathematician. In Graduate texts in mathematics series (Vol. 5, 2nd. ed.). Springer.

    Google Scholar 

  • Odintsov, S. (2003). Algebraic semantics for paraconsistent Nelson’s logic. Journal of Logic and Computation, 13(4), 453–468.

    Article  Google Scholar 

  • Omori, H. (2015). Remarks on naive set theory based on LP. The Review of Symbolic Logic, 8(2), 279–295.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Priest, G. (2007). Paraconsistency and dialetheism. In D. M. Gabbay & J. H. Woods (Eds.), Handbook of the history of logic (The Many Valued and Nonmonotonic Turn in Logic) (Vol. 8, pp. 129–204). North Holland.

    Google Scholar 

  • Priest, G. (2014). Plurivalent logics. Australasian Journal of Logic, 11, Article no. 1.

    Google Scholar 

  • Priest, G. (2016). None of the above: The Catuṣkoṭi in Indian Buddhist Logic. In J.-Y. Beziau, M. Chakraborty, & S. Dutta (Eds.), New Directions in paraconsistent logic (pp. 517–527). Proceedings of the 5th World Congress on Paraconsistency (5th WCP), Springer Proceedings in Mathematics & Statistics series (Vol. 152). New Delhi: Springer.

    Google Scholar 

  • Priest, G., & Berto, F. (2017). Dialetheism. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy (Spring 2017 ed.). https://plato.stanford.edu/archives/spr2017/entries/dialetheism/.

  • Priest, G., Tanaka, K., & Weber, Z. (2016). Paraconsistent logic. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy (Winter 2016 ed.). https://plato.stanford.edu/archives/win2016/entries/logic-paraconsistent/.

  • Restall, G. (1992). A note on naive set theory in LP. Notre Dame Journal of Formal Logic, 33(3), 422–432.

    Article  Google Scholar 

  • Weber, Z. (2010). Transfinite numbers in paraconsistent set theory. The Review of Symbolic Logic, 3(1), 71–92.

    Article  Google Scholar 

Download references

Acknowledgements

We are grateful to X. Caicedo and to the anonymous referees for their remarks, suggestions, and criticisms, which helped to improve the paper. The first author was financially supported by an individual research grant from CNPq, Brazil (308524/2014-4). The second author acknowledges support from a postdoctoral grant from FAPESP, Brazil (2016/21928-0).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marcelo E. Coniglio .

Editor information

Editors and Affiliations

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

Coniglio, M.E., Figallo-Orellano, A. (2019). A Model-Theoretic Analysis of Fidel-Structures for mbC. 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_10

Download citation

Publish with us

Policies and ethics