The computational content of Walras' existence theorem
From MaRDI portal
Publication:632841
DOI10.1016/J.AMC.2010.12.102zbMATH Open1218.91115OpenAlexW2050730702MaRDI QIDQ632841FDOQ632841
Authors: Matthew Hendtlass 
Publication date: 28 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.12.102
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
Auctions, bargaining, bidding and selling, and other market models (91B26) Special types of economic equilibria (91B52) Special types of economic markets (including Cournot, Bertrand) (91B54)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Techniques of constructive analysis
- 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
- 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)
