Combinatorial principles concerning approximations of functions
From MaRDI portal
Publication:3788005
DOI10.1007/BF02017489zbMATH Open0645.03057OpenAlexW1978312966MaRDI QIDQ3788005FDOQ3788005
Authors: Petr Hájek, Jeff Paris
Publication date: 1987
Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/138050
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
fragmentsapproximations of functionscombinatorial principlesprovability or unprovability in PAPudlak principle
Cites Work
Cited In (9)
- Inductive full satisfaction classes
- On some formalized conservation results in arithmetic
- The number and probability of canalizing functions
- Current research on Gödel's incompleteness theorems
- Unprovability of sharp versions of Friedman’s sine-principle
- A WALK WITH GOODSTEIN
- Subsystems of true arithmetic and hierarchies of functions
- On Constructively Non-Morphisms of Enumerated Sets and Constructive Non-Reducibility of Enumerations
- 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)