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...

Full description

Bibliographic Details
Main Author: Alberto Policriti
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