✦ LIBER ✦

A Decidable Class of Equations in Recursive Arithmetic

✍ Scribed by R. L. Goodstein; R. D. Lee

Publisher: John Wiley and Sons
Year: 1966
Tongue: English
Weight: 201 KB
Volume: 12
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19660120118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Decidable Fragment of Recursive Arithm

A Decidable Fragment of Recursive Arithmetic

✍ R. L. Goodstein 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

An Extention of the Decidable Class of E

An Extention of the Decidable Class of Equations Considered by Goodstein and Lee

✍ Nadejda Georgieva 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB 👁 1 views

AN EXTENTION OF THE DECIDABLE CLASS OF EQUATIONS CONSIDERED BY GOODSTEIN AND LEE by NADEJDA GEORGIEVA in Sofia (Bulgaria)

On a Class of Enumeration Problems in Ad

On a Class of Enumeration Problems in Additive Arithmetics

✍ D. Ugrinsparac 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 302 KB

On a Class of Recursively Enumerable Set

On a Class of Recursively Enumerable Sets

✍ Farzad Didehvar 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

## Abstract We define a class of so‐called ∑(__n__)‐sets as a natural closure of recursively enumerable sets __W__~n~ under the relation “∈” and study its properties.

A Model of the Arithmetic of Alephs in t

A Model of the Arithmetic of Alephs in the Equation Calculus

✍ R. J. Plymen 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 English ⚖ 73 KB 👁 2 views

Relatively Recursively Enumerable Versus

Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic

✍ Grzegorz Michalski 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

## Abstract We show that that every countable model of __PA__ has a conservative extension __M__ with a subset __Y__ such that a certain Σ~1~(__Y__)‐formula defines in __M__ a subset which is not r. e. relative to __Y__.