On effectively hypersimple sets (Q2560399)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On effectively hypersimple sets	scientific article

Statements

scholarly article

0 references

On effectively hypersimple sets (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF02219827

0 references

Algebra and Logic

0 references

publication date

1970

0 references

full work available at URL

https://eudml.org/doc/186738

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Marat M. Arslanov

0 references

MaRDI profile type

MaRDI publication profile

0 references

Recursively enumerable sets of positive integers and their decision problems

0 references

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

0 references

A Simple Set Which is Not Effectively Simple

0 references

A maximal set which is not complete

0 references

Effectively Simple Sets

0 references

On a Class of Complete Simple Sets

0 references

Completeness, the Recursion Theorem, and Effectively Simple Sets

0 references

0 references

The Priority Method I

0 references

On the Lattice of Recursively Enumerable Sets

0 references

Complete Recursively Enumerable Sets

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2560399

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2560399&oldid=37353645"