scientific article; zbMATH DE number 934359
zbMATH Open0856.03039MaRDI QIDQ4895089FDOQ4895089
Publication date: 13 October 1996
Title of this publication is not available (Why is that?)
Recommendations
definabilitydynamic logicadmissible setgeneralized computabilityKPU-modelshereditary finite superstructure over a structure
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)
Cited In (27)
- Interval extensions of orders and temporal approximation spaces
- Foundations of programmology
- Absolute and relative properties of negatively numbered families
- Universal functions and unbounded branching trees
- On some reducibility and existential interpretability of structures
- Polish group actions and effectivity
- Families of permutations and ideals of Turing degrees
- Conditional terms in semantic programming
- Jump inversions of algebraic structures and the \({\Sigma}\)-definability
- Title not available (Why is that?)
- Computable torsion abelian groups
- Properties of \(s\Sigma\)-reducibility
- Constructing decidable graphs from decidable structures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universal functions over trees
- The uniformization problem for \(\Sigma\)-predicates in a hereditarily finite list superstructure over the real exponential field
- A sufficient condition for nonpresentability of structures in hereditarily finite superstructures
- Inner constructivizability of functional structures
- Computable Model Theory over the Reals
- Uniformization in superstructures over some extensions of \(\mathbb{R}\)
- On computable presentations of some functional lattices
- Tarski-type problems for free associative algebras
- Fixed Points on the Real Numbers without the Equality Test
- \(\Sigma\)-presentations of the ordering on the reals
- Title not available (Why is that?)
- Constructibility and decidability versus domain independence and absoluteness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895089)
