Completeness and decidability of the deducibility problem for some class of formulas of set theory
Abstract
An extension of results on the decidability of classes of formulas in set theory is proved. In particular a class of restricted quantified formulas is proved to be decidable also in the case in which the underlying axiomatic set theory does not contain the axiom of foundation. For all the classes considered is also studied whether or not they result to be not only decidable, but also complete and a simple decidable but not complete class of formulas is presented.
Downloads
Published
Issue
Section
License
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.
