Sound, totally sound, and unsound recursive equivalence types
From MaRDI portal
DOI10.1016/0168-0072(86)90060-6zbMATH Open0627.03027OpenAlexW2012571151MaRDI QIDQ581397FDOQ581397
Authors: 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
Recommendations
Cites Work
- Automorphisms of supermaximal subspaces
- Maximal theories
- Intersections of algebraically closed fields
- ON A QUESTION OF A. RETZLAFF
- A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
- Title not available (Why is that?)
- Co-immune subspaces and complementation inV∞
- Decidable subspaces and recursively enumerable subspaces
- The universal complementation property
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recursive Equivalence
Cited In (2)
This page was built for publication: Sound, totally sound, and unsound recursive equivalence types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q581397)