HF-computability
From MaRDI portal
Cited in
(29)- Nonpresentability of some structures of analysis in hereditarily finite superstructures
- Conditional terms in semantic programming
- Tarski-type problems for free associative algebras
- What does a group algebra of a free group ``know about the group?
- Recursive terms in semantic programming
- Universal functions and unbounded branching trees
- \(\Sigma\)-definability in hereditarily finite superstructures and computable analysis
- Computable embeddings for pairs of linear orders
- A note on computable embeddings for ordinals and their reverses
- On mutual definability of operations on fields
- Positive numberings in admissible sets
- Universal functions and \(K \Sigma \)-structures
- Universal functions and _ -bounded structures
- \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\)
- A sufficient condition for nonpresentability of structures in hereditarily finite superstructures
- A class of almost \(c\)-simple rings
- Enumeration reducibility and computable structure theory
- Computable model theory over the reals
- On \(\Sigma\)-rigid presentations of the real order
- Nonpresentability of the semigroup \(\omega^\omega\) over \(\mathbb H\mathbb F(\mathbb R)\)
- Universal functions and almost \(c\)-simple models
- Definable Subsets of Polynomial-Time Algebraic Structures
- A computable structure with non-standard computability
- On universal functions in hereditarily finite superstructures
- Generalized fusible numbers and their ordinals
- Numberings on admissible structures over equivalence relations
- Some presentations of the real number field
- Permutation groups and ideals of Turing degrees
- Universal functions over trees
This page was built for publication: HF-computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906566)
