New Computational Paradigms
From MaRDI portal
(Redirected from Publication:5717044)
New Computational Paradigms (scientific article; zbMATH DE number 2246005)
New Computational Paradigms (scientific article; zbMATH DE number 2246005)
Recommendations
Cited in
(20)- Proof mining in topological dynamics
- Proof mining and effective bounds in differential polynomial rings
- Proof-theoretic uniform boundedness and bounded collection principles and countable Heine-Borel compactness
- On the removal of weak compactness arguments in proof mining
- An application of proof mining to nonlinear iterations
- Mathematical logic: proof theory, type theory and constructive mathematics
- Strongly uniform bounds from semi-constructive proofs
- Mining the Archive of Formal Proofs
- scientific article; zbMATH DE number 5652610 (Why is no real title available?)
- Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization
- scientific article; zbMATH DE number 1231647 (Why is no real title available?)
- An inverse Ackermannian lower bound on the local unconditionality constant of the James space
- scientific article; zbMATH DE number 2174396 (Why is no real title available?)
- Some logical metatheorems with applications in functional analysis
- Proof mining in \(\mathbb{R}\)-trees and hyperbolic spaces
- Bounds for indexes of nilpotency in commutative ring theory: a proof mining approach
- The computational content of nonstandard analysis
- PROOF MINING IN Lp SPACES
- General logical metatheorems for functional analysis
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
This page was built for publication: New Computational Paradigms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717044)
