The following pages link to (Q4428885):
Displaying 21 items.
- An alternate proof of Statman's finite completeness theorem (Q436624) (← links)
- The theory of the \(\alpha \) degrees is undecidable (Q607833) (← links)
- Asymptotic densities in logic and type theory (Q931404) (← links)
- On the membership problem for non-linear abstract categorial grammars (Q972435) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- The definability of \(\mathbb{E}\) in self-iterable mice (Q2105098) (← links)
- The IO and OI hierarchies revisited (Q2347807) (← links)
- Kalmár and Péter: Undecidability as a Consequence of Incompleteness (Q3195713) (← links)
- The undecidability of the D<sub>A</sub>-unification problem (Q3478395) (← links)
- Recognizability in the Simply Typed Lambda-Calculus (Q3638274) (← links)
- Undecidable hypotheses in Edward Nelson's internal set theory (Q4005527) (← links)
- (Q4285797) (← links)
- (Q4601873) (← links)
- The variable containment problem (Q4645807) (← links)
- Decidability of all minimal models (Q4647581) (← links)
- (Q4830809) (← links)
- Tarski’s Undefinability Theorem and the Diagonal Lemma (Q5092563) (← links)
- Full abstraction for the second order subset of an ALGOL-like language (Q5096919) (← links)
- (Q5219128) (← links)
- (Q5369483) (← links)
- (Q5505301) (← links)
