✦ LIBER ✦

Provability and Decidability of Arithmetical Universal-Existential Sentences

✍ Scribed by Tung, S.-P.

Book ID: 120092253
Publisher: Oxford University Press
Year: 1986
Tongue: English
Weight: 156 KB
Volume: 18
Category: Article
ISSN: 0024-6093
DOI: 10.1112/blms/18.3.241

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decidable fragments of universal theorie

Decidable fragments of universal theories and existentially closed models

✍ O. V. Belegradek 📂 Article 📅 1981 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 434 KB

Decidability of ∀*∀-Sentences in Members

Decidability of ∀*∀-Sentences in Membership Theories

✍ Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 1007 KB

Decidable and enumerable predicate logic

Decidable and enumerable predicate logics of provability

✍ Giorgie Dzhaparidze 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 958 KB

Fragments of Arithmetic and true sentenc

Fragments of Arithmetic and true sentences

✍ Andrés Cordón-Franco; Alejandro Fernández-Margarit; F. Félix Lara-Martín 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only (up to deductive equivalence) consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of b

Arithmetical Analogues of Productive and

Arithmetical Analogues of Productive and Universal Sets

✍ Bruce M. Horowitz 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

On the Decidability of Subtyping with Bo

On the Decidability of Subtyping with Bounded Existential Types and Implementation Constraints

✍ Stefan Wehr; Peter Thiemann 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 518 KB