TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS (Q2873496): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Kumaraswamy Velupillai / rank
Normal rank
 
Property / author
 
Property / author: Kumaraswamy Velupillai / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56592074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3244478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An intuitionist correction of the fixed-point theorem on the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Berry paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3235339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and incompleteness in classical mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3280274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does Mathematics Need New Axioms? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5843703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Constructive Hahn-Banach Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mistake in Hirsch’s proof of the Brouwer Fixed Point Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Elementary Proof of the No-Retraction Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Thinking and Mathematical Thinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Studies of Turing Machine Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4150678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hahn-Banach theorem: The life and times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3430038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of some theorems of Gödel and Church / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3229401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4070959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructivism Is Difficult / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nicht konstruktiv beweisbare Sätze der Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3146890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production of Ideas by Means of Ideas: A Turing Machine Metaphor / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793005712400017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147282432 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:29, 30 July 2024

scientific article
Language Label Description Also known as
English
TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS
scientific article

    Statements

    TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS (English)
    0 references
    24 January 2014
    0 references
    constructive mathematics
    0 references
    mathematical economics
    0 references
    computability
    0 references
    computable economics
    0 references
    busy beaver functions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers