Sound, totally sound, and unsound recursive equivalence types
type: Item
instance of: scholarly article
title: Sound, totally sound, and unsound recursive equivalence types
zbMATH Open document ID: 0627.03027
DOI: 10.1016/0168-0072(86)90060-6
author: Rodney G. Downey
published in: Annals of Pure and Applied Logic
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 03D50
zbMATH DE Number: 4019043
zbMATH Keywords: unsound
zbMATH Keywords: totally sound
zbMATH Keywords: isols
zbMATH Keywords: r.e. degree
MaRDI profile type: Publication
full work available at URL: 0168-0072(86)90060-6
OpenAlex ID: W2012571151
cites work: Decidable subspaces and recursively enumerable subspaces
cites work: Intersections of algebraically closed fields
cites work: Q3669397
cites work: Q5521482
cites work: Recursive Equivalence
cites work: Q3904556
cites work: Q4769050
cites work: Q3926567
cites work: ON A QUESTION OF A. RETZLAFF
cites work: Co-immune subspaces and complementation inV∞
cites work: A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
cites work: Maximal theories
cites work: Automorphisms of supermaximal subspaces
cites work: The universal complementation property
description: scientific article; zbMATH DE number 4019043