S-Subsets of Natural Numbers
From MaRDI portal
Recommendations
Cited in
(29)- Logically defined subsets of \(\mathbb{N}{}^ k\)
- Conditional terms in semantic programming
- Recursive terms in semantic programming
- On a universal -function over a tree
- Universal functions and \(K \Sigma \)-structures
- Universal functions and _ -bounded structures
- On the collection of all computable subsets on admissible sets
- A class of almost \(c\)-simple rings
- Natural numbers n for which n +s = n +s
- On the index sets of -subsets of the real numbers
- scientific article; zbMATH DE number 4057500 (Why is no real title available?)
- Reducibility on families
- scientific article; zbMATH DE number 2167513 (Why is no real title available?)
- scientific article; zbMATH DE number 1923100 (Why is no real title available?)
- Universal functions and almost \(c\)-simple models
- On -subsets of naturals over abelian groups
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06
- On principles of computability on admissible sets
- Natural numerosities of sets of tuples
- Sets of natural numbers with proscribed subsets
- On universal functions in hereditarily finite superstructures
- \(\Sigma \)-bounded algebraic systems and universal functions. I
- Bounded algebraic systems and universal functions
- Families of permutations and ideals of Turing degrees
- Descriptive properties on admissible sets
- \(\Sigma \)-uniform structures and \(\Sigma \)-functions. I
- \(\Sigma \)-uniform structures and \(\Sigma \)-functions. II
- Permutation groups and ideals of Turing degrees
- Each family of subsets of the urelements generates an admissible set
This page was built for publication: S-Subsets of Natural Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294707)