Constructive assertions in an extension of classical mathematics
From MaRDI portal
Publication:3949046
DOI10.2307/2273147zbMath0488.03034OpenAlexW2060215258MaRDI QIDQ3949046
Publication date: 1982
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273147
semanticsMarkov's principleeffective computabilityadditional unary predicategeneralized Church's thesisselection axiomthe number x is knownuniformity scheme
Abstract data types; algebraic specification (68Q65) Metamathematics of constructive systems (03F50) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Towards Formalizing Non-monotonic Reasoning in Physics: Logical Approach Based on Physical Induction and Its Relation to Kolmogorov Complexity ⋮ INTUITIONISTIC ANALYSIS AT THE END OF TIME ⋮ The knowing mathematician
Cites Work