Weihrauch complexity for elementary embeddings into countable saturated models
From MaRDI portal
Cites work
- \(\mathsf{WKL}_0\) and induction principles in model theory
- \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
- Classical recursion theory. The theory of functions and sets of natural numbers.
- Closed choice and a uniform low basis theorem
- Computable abelian groups
- Effective prime uniqueness
- Elementary properties of Abelian groups
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 3779289 (Why is no real title available?)
- scientific article; zbMATH DE number 1302870 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- scientific article; zbMATH DE number 1303204 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
- Model theory
- On uniform relationships between combinatorial problems
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Subsystems of second order arithmetic
- The atomic model theorem and type omitting
- The elementary theory of abelian groups
- Theorems on deducibility. I.
- Weihrauch Complexity in Computable Analysis
- Weihrauch degrees of elementary embeddings for prime and saturated models
- Weihrauch degrees, omniscience principles and weak computability
This page was built for publication: Weihrauch complexity for elementary embeddings into countable saturated models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7292909)
