The computational content of Walras' existence theorem
From MaRDI portal
Publication:632841
Recommendations
- On the computational content of the Bolzano-Weierstraß Principle
- On the computational content of the Brouwer fixed point theorem
- The computational content of arithmetical proofs
- On total functions, existence theorems and computational complexity
- A computability theoretic equivalent to Vaught's conjecture
- Computability and the Connes embedding problem
- Computability and the Implicit Function Theorem
- scientific article; zbMATH DE number 1746038
- On the computational content of Zorn's lemma
- scientific article; zbMATH DE number 65537
Cites work
- scientific article; zbMATH DE number 4002093 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- An omniscience principle, the König Lemma and the Hahn‐Banach theorem
- Brouwer’s Approximate Fixed-Point Theorem is Equivalent to Brouwer’s Fan Theorem
- Techniques of constructive analysis
- Undecidability of Uzawa equivalence theorem and LLPO (Lesser limited principle of omniscience)
Cited in
(3)
This page was built for publication: The computational content of Walras' existence theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632841)