scientific article; zbMATH DE number 3995659

zbMath0615.03035MaRDI QIDQ4723721

Yuri L. Ershov

Publication date: 1985

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

zbMATH Keywords

abstract data typesadmissible setssigma-definabilityrelative elementary definability

Mathematics Subject Classification ID

Logic in computer science (03B70) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Logic on admissible sets (03C70)

Related Items (6)

Interval extensions of orders and temporal approximation spaces ⋮ Generatability of admissible sets ⋮ On Processes and Structures ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ A Computable Structure with Non-Standard Computability ⋮ Strong \(\Delta_1\)-definability of a model in an admissible set

This page was built for publication: