Finding languages such that $L_1subset L_2subset L_3$ where $L_1,L_3notin$ RE and $L_2in$ R [duplicate]
$begingroup$
This question is an exact duplicate of:
Finding languages such that $L_{1} subseteq L_{2} subseteq L_{3}$ where $L_{1}, L_{3} notin mathbb{R}$, $L_{2} in mathbb{R}$
1 answer
I am struggling to find such languages $L_1$, $L_2$, and $L_3$ such that
$L_1subset L_2subset L_3$
where $L_1,L_3notin$ RE and $L_2in$ R.
I know they exist, I need help finding them.
computability formal-languages automata turing-machines
$endgroup$
marked as duplicate by amWhy, jgon, zipirovich, Surb, Math1000 Jan 9 at 21:04
This question was marked as an exact duplicate of an existing question.
add a comment |
$begingroup$
This question is an exact duplicate of:
Finding languages such that $L_{1} subseteq L_{2} subseteq L_{3}$ where $L_{1}, L_{3} notin mathbb{R}$, $L_{2} in mathbb{R}$
1 answer
I am struggling to find such languages $L_1$, $L_2$, and $L_3$ such that
$L_1subset L_2subset L_3$
where $L_1,L_3notin$ RE and $L_2in$ R.
I know they exist, I need help finding them.
computability formal-languages automata turing-machines
$endgroup$
marked as duplicate by amWhy, jgon, zipirovich, Surb, Math1000 Jan 9 at 21:04
This question was marked as an exact duplicate of an existing question.
add a comment |
$begingroup$
This question is an exact duplicate of:
Finding languages such that $L_{1} subseteq L_{2} subseteq L_{3}$ where $L_{1}, L_{3} notin mathbb{R}$, $L_{2} in mathbb{R}$
1 answer
I am struggling to find such languages $L_1$, $L_2$, and $L_3$ such that
$L_1subset L_2subset L_3$
where $L_1,L_3notin$ RE and $L_2in$ R.
I know they exist, I need help finding them.
computability formal-languages automata turing-machines
$endgroup$
This question is an exact duplicate of:
Finding languages such that $L_{1} subseteq L_{2} subseteq L_{3}$ where $L_{1}, L_{3} notin mathbb{R}$, $L_{2} in mathbb{R}$
1 answer
I am struggling to find such languages $L_1$, $L_2$, and $L_3$ such that
$L_1subset L_2subset L_3$
where $L_1,L_3notin$ RE and $L_2in$ R.
I know they exist, I need help finding them.
This question is an exact duplicate of:
Finding languages such that $L_{1} subseteq L_{2} subseteq L_{3}$ where $L_{1}, L_{3} notin mathbb{R}$, $L_{2} in mathbb{R}$
1 answer
computability formal-languages automata turing-machines
computability formal-languages automata turing-machines
edited Jan 9 at 19:52
Surb
37.7k94375
37.7k94375
asked Jan 9 at 17:39
Tomer LevyTomer Levy
406
406
marked as duplicate by amWhy, jgon, zipirovich, Surb, Math1000 Jan 9 at 21:04
This question was marked as an exact duplicate of an existing question.
marked as duplicate by amWhy, jgon, zipirovich, Surb, Math1000 Jan 9 at 21:04
This question was marked as an exact duplicate of an existing question.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $L$ be some language not in RE. Take
$L_1 = 0L$.
$L_2 = 0Sigma^*$.
$L_3 = 0Sigma^* cup 1L$.
$endgroup$
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let $L$ be some language not in RE. Take
$L_1 = 0L$.
$L_2 = 0Sigma^*$.
$L_3 = 0Sigma^* cup 1L$.
$endgroup$
add a comment |
$begingroup$
Let $L$ be some language not in RE. Take
$L_1 = 0L$.
$L_2 = 0Sigma^*$.
$L_3 = 0Sigma^* cup 1L$.
$endgroup$
add a comment |
$begingroup$
Let $L$ be some language not in RE. Take
$L_1 = 0L$.
$L_2 = 0Sigma^*$.
$L_3 = 0Sigma^* cup 1L$.
$endgroup$
Let $L$ be some language not in RE. Take
$L_1 = 0L$.
$L_2 = 0Sigma^*$.
$L_3 = 0Sigma^* cup 1L$.
answered Jan 9 at 19:49
Yuval FilmusYuval Filmus
48.5k471144
48.5k471144
add a comment |
add a comment |
