Pages that link to "Item:Q1817073"
From MaRDI portal
The following pages link to Definability, decidability, complexity (Q1817073):
Displaying 11 items.
- Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic (Q598270) (← links)
- On arithmetical first-order theories allowing encoding and decoding of lists (Q1960537) (← links)
- Definability in the real universe (Q2906565) (← links)
- Some new results in monadic second-order arithmetic (Q3195649) (← links)
- (Q4249223) (← links)
- (Q4429280) (← links)
- (Q4432978) (← links)
- On the ‘definability of definable’ problem of Alfred Tarski, Part II (Q5045614) (← links)
- Complexity, decidability and completeness (Q5480615) (← links)
- Decidability of the theory of the natural integers with the Cantor pairing function and the successor (Q5941253) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)