✦ LIBER ✦

Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

✍ Scribed by Franco Parlamento; Alberto Policriti

Publisher: Springer Netherlands
Year: 1991
Tongue: English
Weight: 686 KB
Volume: 7
Category: Article
ISSN: 0168-7433
DOI: 10.1007/bf00243810

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decision procedures for elementary subla

Decision procedures for elementary sublanguages of set theory

✍ D. Cantone; V. Cutello 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 587 KB

Decision procedures for elementary subla

Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions

✍ Alfredo Ferro; Eugenio G. Omodeo; Jacob T. Schwartz 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

Decision procedures for elementary subla

Decision procedures for elementary sublanguages of set theory VII. Validity in set theory when a choice operator is present

✍ A. Ferro; E. G. Omodeo 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 662 KB

Decision procedures for elementary subla

Decision procedures for elementary sublanguages of set theory: XII. Multilevel syllogistic extended with singleton and choice operators

✍ A. Ferro 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 657 KB

Decision procedures for elementary subla

Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set-theoretic formulae

✍ D. Cantone; A. Ferro; E. G. Omodeo 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 701 KB

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