scientific article; zbMATH DE number 1534487

zbMath0954.03044MaRDI QIDQ4517267

V. G. Puzarenko

Publication date: 21 November 2000

Full work available at URL: https://eudml.org/doc/187924

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

simple theoryregular theorygeneralized computability over admissible sets

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (6)

Descriptive properties on admissible sets ⋮ Positive numberings in admissible sets ⋮ A semilattice of numberings. II ⋮ Limitwise monotonic reducibility of sets and \(\Sigma\)-definability of abelian groups ⋮ A Computable Structure with Non-Standard Computability ⋮ Partial decidable presentations in hyperarithmetic

This page was built for publication: