Pages that link to "Item:Q2784783"
From MaRDI portal
The following pages link to Decidability and undecidability in the enumerable Turing degrees (Q2784783):
Displaying 12 items.
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- Turing determinacy and the continuum hypothesis (Q1824617) (← links)
- From decidability to undecidability by considering regular sets of instances (Q2062120) (← links)
- Low level nondefinability results: domination and recursive enumeration (Q2869914) (← links)
- (Q3329451) (← links)
- Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine (Q3453734) (← links)
- (Q4219024) (← links)
- (Q4835608) (← links)
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE (Q4882918) (← links)
- (Q4934351) (← links)
- An extension of the recursively enumerable Turing degrees (Q5294136) (← links)
- Every incomplete computably enumerable truth-table degree is branching (Q5931217) (← links)