A problem concerning the notion of definability
From MaRDI portal
Cited in
(7)- Tarski's 1944 polemical remarks and Naess' ``experimental philosophy
- Definability, decidability, complexity
- Arithmetical Predicates and Function Quantifiers
- On the ‘definability of definable’ problem of Alfred Tarski, Part II
- 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
- Logic and biology: the correspondence between Alfred Tarski and Joseph H. Woodger
This page was built for publication: A problem concerning the notion of definability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5785176)