A problem concerning the notion of definability
From MaRDI portal
Publication:5785176
DOI10.2307/2267331zbMath0029.24205MaRDI QIDQ5785176
Publication date: 1948
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2267331
Related Items
Proof Complexity of Non-classical Logics, Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic, Tarski's 1944 polemical remarks and Naess' ``experimental philosophy, Definability, decidability, complexity, Arithmetical Predicates and Function Quantifiers