scientific article; zbMATH DE number 890268

zbMath0870.03019MaRDI QIDQ4882531

Yuri L. Ershov

Publication date: 18 June 1996

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

zbMATH Keywords

dynamic logicGödel incompleteness theorem\(\Sigma\)-definabilitycomputable numberingsgeneralized computabilityf-spaces\(\Delta\)-separation\(\Sigma\)-collection\(\Sigma\)-reflectioncomputability on admissible setsconstructive algebraic systemshereditary finite superstructure over a structureKPU-modelmodels definable in admissible setsrecursively saturated systems

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 (29)

On the complexity of formulas in semantic programming ⋮ Positive presentations of families relative to \(e\)-oracles ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Nonpresentability of some structures of analysis in hereditarily finite superstructures ⋮ THE TREE OF TUPLES OF A STRUCTURE ⋮ Generalized hyperarithmetical computability over structures ⋮ Processes and structures on approximation spaces ⋮ On functors enumerating structures ⋮ On Processes and Structures ⋮ On mutual definability of operations on fields ⋮ On \(\Sigma\)-rigid presentations of the real order ⋮ A computable structure with nonstandard computability ⋮ What does a group algebra of a free group ``know about the group? ⋮ Definable Sets in Generic Structures and their Cardinalities ⋮ Semidecidable numberings in admissible sets ⋮ Recursive terms in semantic programming ⋮ \(\Sigma\)-definability in hereditarily finite superstructures and computable analysis ⋮ Universal functions and almost \(c\)-simple models ⋮ Remarks on Σ–definability without the equality test over the Reals ⋮ COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY ⋮ Maximality and minimality under limitwise monotonic reducibility ⋮ Decompositions of decidable abelian groups ⋮ \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\) ⋮ Logical language of description of polynomial computing ⋮ A Computable Structure with Non-Standard Computability ⋮ Spectra of theories and structures ⋮ On decidability of list structures ⋮ Partial decidable presentations in hyperarithmetic ⋮ A class of almost \(c\)-simple rings

This page was built for publication: