Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3847370

From MaRDI portal
Publication:3317092
Jump to:navigation, search

zbMATH Open0534.03016MaRDI QIDQ3317092FDOQ3317092


Authors: Robert Byerly Edit this on Wikidata


Publication date: 1984



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 3847369
  • PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
  • Definable structures in the lattice of recursively enumerable sets
  • scientific article
  • scientific article; zbMATH DE number 4004169


zbMATH Keywords

definability of recursively enumerable sets


Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Complexity of computation (including implicit computational complexity) (03D15)



Cited In (3)

  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • On the Characterization of Recursively Enumerable Sets as Pseudo- Diophantine





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317092)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3317092&oldid=16547679"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 12:50. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki