2000 character limit reached
Leibniz's law and paraconsistent models of ZFC
Published 12 Oct 2022 in math.LO | (2210.06626v2)
Abstract: In this paper, we present full models for some Paraconsistent Set Theories (PSTs). These models are built over Fidel semantics where they are specific first-order structures in the sense of Model Theory. These structures are known as F-structures in the literature and they are not algebras in the universal algebra sense. We demonstrate how is possible to present paraconsistent models for ZFC for any of PSTs studied in this paper, by adapting the proofs given on the celebrated John Lane Bell's books; in general, we adapt the proofs in the mentioned book throughout the work.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.