Completeness and decidability of the deducibility problem for some class of formulas of set theory
<p style="font-style: normal;"><span style="font-family: DejaVu Sans,sans-serif;">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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
1987-11-01
|
| Series: | Le Matematiche |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/723 |
| id |
doaj-ece07965f11a4834b4585bc404bd3060 |
|---|---|
| record_format |
Article |
| spelling |
doaj-ece07965f11a4834b4585bc404bd30602020-11-25T01:21:33ZengUniversità degli Studi di CataniaLe Matematiche0373-35052037-52981987-11-01421,24966687Completeness and decidability of the deducibility problem for some class of formulas of set theoryAlberto Policriti<p style="font-style: normal;"><span style="font-family: DejaVu Sans,sans-serif;">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.</span></p>http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/723 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Alberto Policriti |
| spellingShingle |
Alberto Policriti Completeness and decidability of the deducibility problem for some class of formulas of set theory Le Matematiche |
| author_facet |
Alberto Policriti |
| author_sort |
Alberto Policriti |
| title |
Completeness and decidability of the deducibility problem for some class of formulas of set theory |
| title_short |
Completeness and decidability of the deducibility problem for some class of formulas of set theory |
| title_full |
Completeness and decidability of the deducibility problem for some class of formulas of set theory |
| title_fullStr |
Completeness and decidability of the deducibility problem for some class of formulas of set theory |
| title_full_unstemmed |
Completeness and decidability of the deducibility problem for some class of formulas of set theory |
| title_sort |
completeness and decidability of the deducibility problem for some class of formulas of set theory |
| publisher |
Università degli Studi di Catania |
| series |
Le Matematiche |
| issn |
0373-3505 2037-5298 |
| publishDate |
1987-11-01 |
| description |
<p style="font-style: normal;"><span style="font-family: DejaVu Sans,sans-serif;">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.</span></p> |
| url |
http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/723 |
| work_keys_str_mv |
AT albertopolicriti completenessanddecidabilityofthededucibilityproblemforsomeclassofformulasofsettheory |
| _version_ |
1725129586467930112 |