✦ LIBER ✦

Complete, Recursively Enumerable Relations in Arithmetic

✍ Scribed by Giovanna D'Agostino; Mario Magnago

Publisher: John Wiley and Sons
Year: 1995
Tongue: English
Weight: 489 KB
Volume: 41
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19950410107

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Using only propositional connectives and the provability predicate of a Σ~1~‐sound theory T containing Peano Arithmetic we define recursively enumerable relations that are complete for specific natural classes of relations, as the class of all r. e. relations, and the class of all strict partial orders. We apply these results to give representations of these classes in T by means of formulas.

📜 SIMILAR VOLUMES

Recursively Enumerable Images of Arithme

Recursively Enumerable Images of Arithmetic Sets

✍ Richard Rosenberg 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 656 KB

On Some Properties of Recursively Enumer

On Some Properties of Recursively Enumerable Equivalence Relations

✍ Stefano Baratella 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

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__.

The Index Set of Injectively Enumerable

The Index Set of Injectively Enumerable Classes of Recursively Enumerable Sets in ∑5-Complete

✍ Stephan Wehner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 372 KB

## Abstract I introduce an effective enumeration of all effective enumerations of classes of r. e. sets and define with this the index set __IE__ of injectively enumerable classes. It is easy to see that this set is ∑~5~ in the Arithmetical Hierarchy and I describe a proof for the ∑~5~‐hardness of

DEFINABILITY OF RECURSIVELY ENUMERABLE S

DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY

✍ Robert E. Byerly 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 330 KB

The Recursively Mahlo Property in Second

The Recursively Mahlo Property in Second Order Arithmetic

✍ Michael Rathjen 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 388 KB

## Abstract The paper characterizes the second order arithmetic theorems of a set theory that features a recursively Mahlo universe; thereby complementing prior proof‐theoretic investigations on this notion. It is shown that the property of being recursively Mahlo corresponds to a certain kind of β