The following pages link to (Q3880831):
Displaying 18 items.
- Aggregation theory and the relevance of some issues to others (Q893423) (← links)
- Introduction to Turing categories (Q998306) (← links)
- The limits of E-recursive enumerability (Q1095136) (← links)
- Inadmissible forcing (Q1102950) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- Query languages for hierarchic databases (Q1201723) (← links)
- From axiomatics to intrinsic characterization: some open problems in computable analysis (Q1292411) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- Computability by nondeterministic program and the Moschovakis search computability (Q1905256) (← links)
- Reverse Mathematics: The Playground of Logic (Q3163663) (← links)
- Annual Meeting of the Association for Symbolic Logic, Los Angeles, 1989 (Q3478380) (← links)
- European Summer Meeting of the Association for Symbolic Logic (Logic Colloquium '88), Padova, 1988 (Q3478381) (← links)
- Axiomatic recursion theory and the continuous functionals (Q3717039) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Generalizing Computability Theory to Abstract Algebras (Q4637219) (← links)
- Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles (Q5687408) (← links)
- Computability and non-monotone induction (Q6594831) (← links)
