Decidability of ∀*∀-Sentences in Membership Theories
✍ Scribed by Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 1007 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
DECIDABLE CLASSES OF NUMBER-THEORETIC SENTENCES by I. J. HEATH in Leicester (England) A. Method of Construction 1. Limited Constituents Terminology. Let h ' denote the class of natural numbers 0, 1 , 2 , . . . We say that P ( x l , . . . , x,) is a predicate if P : N" -+ ( 0 , l}, and that f(xl, . .
## Abstract In this paper we show that the usual intuitionistic characterization of the decidability of the propositional function __B(x) prop__ [__x : A__], i. e. to require that the predicate (∀__x__ ∈ __A__) (__B(x)__ ∨ ¬ __B(x)__) is provable, is equivalent, when working within the framework of