The paper studies the natural version of m-reducibility between recursively enumerable preordered structures, and shows that many recursively enumerable preordered structures arising from logic are universal with respect to this reducibility.

Montagna, F., Sorbi, A. (1985). Universal recursion theoretic properties of r.e. preordered structures. THE JOURNAL OF SYMBOLIC LOGIC, 50(2), 397-406 [10.2307/2274228].

Universal recursion theoretic properties of r.e. preordered structures

Montagna, Franco;Sorbi, Andrea
1985-01-01

Abstract

The paper studies the natural version of m-reducibility between recursively enumerable preordered structures, and shows that many recursively enumerable preordered structures arising from logic are universal with respect to this reducibility.
1985
Montagna, F., Sorbi, A. (1985). Universal recursion theoretic properties of r.e. preordered structures. THE JOURNAL OF SYMBOLIC LOGIC, 50(2), 397-406 [10.2307/2274228].
File in questo prodotto:
File Dimensione Formato  
montagna-sorbi.pdf

non disponibili

Descrizione: Articolo
Tipologia: PDF editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 229.07 kB
Formato Adobe PDF
229.07 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/1082624