Finding languages such that $L_1subset L_2subset L_3$ where $L_1,L_3notin$ RE and $L_2in$ R [duplicate]












1












$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.










share|cite|improve this question











$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.























    1












    $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.










    share|cite|improve this question











    $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.





















      1












      1








      1





      $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.










      share|cite|improve this question











      $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






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      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.
























          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          Let $L$ be some language not in RE. Take





          • $L_1 = 0L$.


          • $L_2 = 0Sigma^*$.


          • $L_3 = 0Sigma^* cup 1L$.






          share|cite|improve this answer









          $endgroup$




















            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            0












            $begingroup$

            Let $L$ be some language not in RE. Take





            • $L_1 = 0L$.


            • $L_2 = 0Sigma^*$.


            • $L_3 = 0Sigma^* cup 1L$.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              Let $L$ be some language not in RE. Take





              • $L_1 = 0L$.


              • $L_2 = 0Sigma^*$.


              • $L_3 = 0Sigma^* cup 1L$.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                Let $L$ be some language not in RE. Take





                • $L_1 = 0L$.


                • $L_2 = 0Sigma^*$.


                • $L_3 = 0Sigma^* cup 1L$.






                share|cite|improve this answer









                $endgroup$



                Let $L$ be some language not in RE. Take





                • $L_1 = 0L$.


                • $L_2 = 0Sigma^*$.


                • $L_3 = 0Sigma^* cup 1L$.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 9 at 19:49









                Yuval FilmusYuval Filmus

                48.5k471144




                48.5k471144















                    Popular posts from this blog

                    MongoDB - Not Authorized To Execute Command

                    How to fix TextFormField cause rebuild widget in Flutter

                    in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith