Combinatorial principles concerning approximations of functions
From MaRDI portal
Publication:3788005
Recommendations
- Combinatorial integral approximation
- On the approximation by rational combinations of a class of functions
- Approximation of functions and sets
- General techniques for combinatorial approximation
- Combinatorial principles in nonstandard analysis
- scientific article; zbMATH DE number 5030436
- scientific article; zbMATH DE number 1166296
- Approximation of univalent functions by compositions
- Interpolation and Combinatorial Functions
Cites work
- scientific article; zbMATH DE number 3916272 (Why is no real title available?)
- scientific article; zbMATH DE number 3566838 (Why is no real title available?)
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- On Gödel incompleteness and finite combinatorics
- Rapidly growing Ramsey functions
- ∏ 0 1 Classes and Degrees of Theories
Cited in
(9)- On Constructively Non-Morphisms of Enumerated Sets and Constructive Non-Reducibility of Enumerations
- Unprovability of sharp versions of Friedman’s sine-principle
- On some formalized conservation results in arithmetic
- Inductive full satisfaction classes
- Current research on Gödel's incompleteness theorems
- Subsystems of true arithmetic and hierarchies of functions
- A WALK WITH GOODSTEIN
- The number and probability of canalizing functions
- On principles between \(\Sigma_1\)- and \(\Sigma_2\)-induction, and monotone enumerations
This page was built for publication: Combinatorial principles concerning approximations of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3788005)
