Sound, totally sound, and unsound recursive equivalence types

DOI10.1016/0168-0072(86)90060-6zbMath0627.03027OpenAlexW2012571151MaRDI QIDQ581397

Rodney G. Downey

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90060-6

zbMATH Keywords

isolsr.e. degreetotally soundunsound

Mathematics Subject Classification ID

Recursive equivalence types of sets and structures, isols (03D50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersections of algebraically closed fields
• Maximal theories
• ON A QUESTION OF A. RETZLAFF
• A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
• Automorphisms of supermaximal subspaces
• Co-immune subspaces and complementation inV_∞
• Decidable subspaces and recursively enumerable subspaces
• The universal complementation property
• Recursive Equivalence

This page was built for publication: Sound, totally sound, and unsound recursive equivalence types