scientific article; zbMATH DE number 934359

zbMath0856.03039MaRDI QIDQ4895089

Yuri L. Ershov

Publication date: 13 October 1996

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

zbMATH Keywords

admissible setdynamic logicdefinabilitygeneralized computabilityKPU-modelshereditary finite superstructure over a structure

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (23)

Interval extensions of orders and temporal approximation spaces ⋮ On some reducibility and existential interpretability of structures ⋮ Jump inversions of algebraic structures and the \({\Sigma}\)-definability ⋮ A sufficient condition for nonpresentability of structures in hereditarily finite superstructures ⋮ Inner constructivizability of functional structures ⋮ Universal functions over trees ⋮ Computable torsion abelian groups ⋮ Conditional terms in semantic programming ⋮ Families of permutations and ideals of Turing degrees ⋮ Uniformization in superstructures over some extensions of \(\mathbb{R}\) ⋮ Tarski-type problems for free associative algebras ⋮ Computable Model Theory over the Reals ⋮ Polish group actions and effectivity ⋮ Universal functions and unbounded branching trees ⋮ Fixed Points on the Real Numbers without the Equality Test ⋮ Constructibility and decidability versus domain independence and absoluteness ⋮ Absolute and relative properties of negatively numbered families ⋮ Constructing decidable graphs from decidable structures ⋮ On computable presentations of some functional lattices ⋮ Foundations of programmology ⋮ The uniformization problem for \(\Sigma\)-predicates in a hereditarily finite list superstructure over the real exponential field ⋮ \(\Sigma\)-presentations of the ordering on the reals ⋮ Properties of \(s\Sigma\)-reducibility

This page was built for publication: