scientific article; zbMATH DE number 3817684

zbMATH Open0517.03013MaRDI QIDQ3665086FDOQ3665086

Authors: Eberhard Herrmann 

Publication date: 1983

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

zbMATH Keywords

finite graphsrecursively enumerable setsdecision problemBoolean pairselementarily definable

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35)

Cited In (4)

• Maximal theories
• On the lattices of effectively open sets
• The theory of the polynomial many-one degrees of recursive sets is undecidable
• Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces

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 Q3665086)