Abstract
We study the non-Fregean propositional logic with propositional quantifiers, denoted by SCIQ. We prove that SCIQ does not have the finite model property and that it is undecidable. We also present examples of how to interpret in SCIQ various mathematical theories, such as the theory of groups, rings, and fields, and we characterize the spectra of SCIQ-sentences. Finally, we present a translation of SCIQ into a classical two-sorted first-order logic, and we use the translation to prove some model-theoretic properties of SCIQ.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.