✦ LIBER ✦

Undecidability results for restricted universally quantified formulae of set theory

✍ Scribed by F. Parlamento; A. Policriti

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 759 KB
Volume: 46
Category: Article
ISSN: 0010-3640
DOI: 10.1002/cpa.3160460104

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decision procedures for elementary subla

Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions

✍ M. Breban; A. Ferro; E. G. Omodeo; J. T. Schwartz 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

In this paper we describe a simple semi-decision algorithm applicable to a wide class of quantified formulas. The formulas we consider are built using the propositional connectives from prenex formulas in a language for which a decision algorithm for the corresponding quantifier-free theory T is ava

THE DECISION PROBLEM FOR RESTRICTED UNIV

THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION

✍ Franco Parlamento; Alberto Policriti 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

## Abstract The still unsettled decision problem for the restricted purely universal formulae ((∀)~0~‐formulae) of the first order set‐theoretic language based over =, ∈ is discussed in relation with the adoption or rejection of the axiom of foundation. Assuming the axiom of foundation, the related