Pages that link to "Item:Q3993070"
From MaRDI portal
The following pages link to Computability. Computable functions, logic, and the foundations of mathematics (Q3993070):
Displaying 12 items.
- Mathematical foundations for computer science. Sets, logic, recursion (Q366330) (← links)
- Martin Davis on computability, computational logic, and mathematical foundations (Q505399) (← links)
- Proofs and algorithms. An introduction to logic and computability (Q625290) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Recursive functions and metamathematics. Problems of completeness and decidability, Gödel's theorems (Q1125201) (← links)
- The intrinsic difficulty of recursive functions (Q1919986) (← links)
- Omnipresence, multipresence and ubiquity: kinds of generality in and around mathematics and logics (Q1942335) (← links)
- Prime simplicity (Q2268042) (← links)
- Mathematics as the Art of Abstraction (Q2950040) (← links)
- (Q3998431) (← links)
- Research and Development in Computable Production Functions (Q4660035) (← links)
- Computability and Recursion (Q5689263) (← links)