scientific article
From MaRDI portal
Publication:3993070
zbMath0685.03001MaRDI QIDQ3993070
Richard L. Epstein, Walter Alexandre Carnielli
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinesparadoxespropositional logicconstructive mathematicscomputabilityfoundations of mathematicsrecursive functionsinfiniteGödel's incompleteness theoremsintuitionismfinitismChurch's Thesisrecursive mathematicsphilosophical problemsBishop-style constructivismfirst- order-logic
Related Items
The intrinsic difficulty of recursive functions ⋮ Mathematics as the Art of Abstraction ⋮ Strict finitism and feasibility ⋮ Omnipresence, multipresence and ubiquity: kinds of generality in and around mathematics and logics ⋮ Computability and Recursion ⋮ Research and Development in Computable Production Functions ⋮ Prime simplicity ⋮ Turing oracle machines, online computing, and three displacements in computability theory
This page was built for publication:
