Fibers of the morphism from the free Heyting algebra to the free Boolean algebraPropositional logic with categoriesAdjunction between classic and intuitionistic logicIs there a probability theory developed in intuitionistic logic?Examples of complete distributive lattices that are not Heyting algebrasHeyting algebras originating from directed graphsWhich Heyting algbras arise out of some elementary topos which satisfies the ultrafilter principle?Lattices without nontrivial dense elementsIs this property a new large cardinal notion?What is the dual of generating Boolean subalgebra by subexpressions of a modal formula?Is there a version of the “infinitary” disjunctive normal form theorem for topoi and slice categories?

Fibers of the morphism from the free Heyting algebra to the free Boolean algebra


Propositional logic with categoriesAdjunction between classic and intuitionistic logicIs there a probability theory developed in intuitionistic logic?Examples of complete distributive lattices that are not Heyting algebrasHeyting algebras originating from directed graphsWhich Heyting algbras arise out of some elementary topos which satisfies the ultrafilter principle?Lattices without nontrivial dense elementsIs this property a new large cardinal notion?What is the dual of generating Boolean subalgebra by subexpressions of a modal formula?Is there a version of the “infinitary” disjunctive normal form theorem for topoi and slice categories?













8












$begingroup$


For $kinmathbbN$, let $H_k$ be the free Heyting algebra on $k$ variables $p_1,ldots,p_k$ and $B_k$ be the free Boolean algebra on the same $k$ variables. Thus, $B_k$ has $2^2^k$ elements (corresponding to all possible truth-value tables with $k$ entries), while $H_k$ is infinite as soon as $kgeq 1$.



Since Boolean algebras are, in particular, Heyting algebras, there is a natural morphism $psi colon H_k to B_k$ (taking each $p_i$ to the corresponding Boolean variable).



Example: For $k=1$ (and writing $p:=p_1$), the algebra $H_1$ is the (infinite) Rieger-Nishimura lattice (see here), while $B_1$ has four elements namely $bot,p,neg p,top$. The morphism $psi$ takes the single element $bot$ to $bot$, the two $p$ and $negneg p$ to $p$, the single $neg p$ to $neg p$, and every other element of $H_1$ to $top$. So three of its fibers are finite while the last is infinite.




Question: Which elements $u in B_k$ have finite fiber $psi^-1(u)$, and how can we describe their cardinalities or, better, their elements?











share|cite|improve this question









$endgroup$
















    8












    $begingroup$


    For $kinmathbbN$, let $H_k$ be the free Heyting algebra on $k$ variables $p_1,ldots,p_k$ and $B_k$ be the free Boolean algebra on the same $k$ variables. Thus, $B_k$ has $2^2^k$ elements (corresponding to all possible truth-value tables with $k$ entries), while $H_k$ is infinite as soon as $kgeq 1$.



    Since Boolean algebras are, in particular, Heyting algebras, there is a natural morphism $psi colon H_k to B_k$ (taking each $p_i$ to the corresponding Boolean variable).



    Example: For $k=1$ (and writing $p:=p_1$), the algebra $H_1$ is the (infinite) Rieger-Nishimura lattice (see here), while $B_1$ has four elements namely $bot,p,neg p,top$. The morphism $psi$ takes the single element $bot$ to $bot$, the two $p$ and $negneg p$ to $p$, the single $neg p$ to $neg p$, and every other element of $H_1$ to $top$. So three of its fibers are finite while the last is infinite.




    Question: Which elements $u in B_k$ have finite fiber $psi^-1(u)$, and how can we describe their cardinalities or, better, their elements?











    share|cite|improve this question









    $endgroup$














      8












      8








      8


      1



      $begingroup$


      For $kinmathbbN$, let $H_k$ be the free Heyting algebra on $k$ variables $p_1,ldots,p_k$ and $B_k$ be the free Boolean algebra on the same $k$ variables. Thus, $B_k$ has $2^2^k$ elements (corresponding to all possible truth-value tables with $k$ entries), while $H_k$ is infinite as soon as $kgeq 1$.



      Since Boolean algebras are, in particular, Heyting algebras, there is a natural morphism $psi colon H_k to B_k$ (taking each $p_i$ to the corresponding Boolean variable).



      Example: For $k=1$ (and writing $p:=p_1$), the algebra $H_1$ is the (infinite) Rieger-Nishimura lattice (see here), while $B_1$ has four elements namely $bot,p,neg p,top$. The morphism $psi$ takes the single element $bot$ to $bot$, the two $p$ and $negneg p$ to $p$, the single $neg p$ to $neg p$, and every other element of $H_1$ to $top$. So three of its fibers are finite while the last is infinite.




      Question: Which elements $u in B_k$ have finite fiber $psi^-1(u)$, and how can we describe their cardinalities or, better, their elements?











      share|cite|improve this question









      $endgroup$




      For $kinmathbbN$, let $H_k$ be the free Heyting algebra on $k$ variables $p_1,ldots,p_k$ and $B_k$ be the free Boolean algebra on the same $k$ variables. Thus, $B_k$ has $2^2^k$ elements (corresponding to all possible truth-value tables with $k$ entries), while $H_k$ is infinite as soon as $kgeq 1$.



      Since Boolean algebras are, in particular, Heyting algebras, there is a natural morphism $psi colon H_k to B_k$ (taking each $p_i$ to the corresponding Boolean variable).



      Example: For $k=1$ (and writing $p:=p_1$), the algebra $H_1$ is the (infinite) Rieger-Nishimura lattice (see here), while $B_1$ has four elements namely $bot,p,neg p,top$. The morphism $psi$ takes the single element $bot$ to $bot$, the two $p$ and $negneg p$ to $p$, the single $neg p$ to $neg p$, and every other element of $H_1$ to $top$. So three of its fibers are finite while the last is infinite.




      Question: Which elements $u in B_k$ have finite fiber $psi^-1(u)$, and how can we describe their cardinalities or, better, their elements?








      lo.logic lattice-theory intuitionism






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 10 hours ago









      Gro-TsenGro-Tsen

      9,884234101




      9,884234101




















          1 Answer
          1






          active

          oldest

          votes


















          10












          $begingroup$

          $leteqleftrightarrow$Notice that $psi(A)=u$ iff $vdash_mathrmCPCAeq u$ iff $vdash_mathrmIPCnegneg(Aeq u)$. (I will write just $vdash$ for $vdash_mathrmIPC$.) Thus:



          • $bot$ has a one-element fiber consisting of $bot$: if $vdashnegneg(Aeqbot)$, then $vdashneg A$.


          • For each $i$, $u_i:=p_ilandbigwedge_jne ineg p_j$ has a two-element fiber consisting of $p_ilandbigwedge_jne ineg p_j$ and $negneg p_ilandbigwedge_jne ineg p_j$: if $vdashnegneg(Aeq u_i)$, then $vdash Atoneg p_j$ for all $jne i$, thus $A$ is equivalent to $bigwedge_jne ineg p_jland A(bot,dots,bot,p_i,bot,dots)$. The formula $A':=A(bot,dots,bot,p_i,bot,dots)$ of one variable also has to imply $negneg p_i$, hence by your analysis of the Rieger–Nishimura lattice, it must be equivalent to $negneg p_i$ or to $p_i$. (It can’t be $bot$.)


          • Likewise, $u=bigwedge_ineg p_i$ has a one-element fibre consisting of $bigwedge_ineg p_i$.


          In the remaining cases, the fiber is infinite:



          • If $u=bigwedge_iin Ip_ilandbigwedge_inotin Ineg p_i$ where $|I|ge2$, fix $jne k$ in $I$. Then the fiber of $u$ includes all formulas of the form $$bigwedge_substackiin I\ine j,kp_ilandbigwedge_inotin Ineg p_iland A(p_j,p_k),$$
            where $A(p_j,p_k)$ is a formula of two variables implying $negneg(p_jland p_k)$ and implied by $p_jland p_k$. That there are infinitely many such formulas follows from the fact that in the universal intuitionistic frame of rank $2$, there are infinitely many points such that the only leaf they see is the one satisfying both variables.


          • If $u$ has $ge2$ satisfying assignments $e,e'$, let $I_a,b$, $a,b=0,1$, be the set of indices of variables assigned to $a$ by $e$, and to $b$ by $e'$. Without loss of generality, $I_0,1nevarnothing$, hence we may fix $jin I_0,1$. Then $psi^-1(u)$ includes all formulas of the form
            $$negneg uland A(p_j)$$
            where $A$ is a formula in one variable such that $vdashnegneg A(p_j)$. All these formulas are inequivalent: if
            $$vdashnegneg uland A(p_j)to A'(p_j),$$
            we may substitute $bot$ for all $p_i$ such that $iin I_0,0$, $top$ for $iin I_1,1$, $p_j$ for $iin I_0,1$, and $neg p_j$ for $iin I_1,0$. This substitution turns $negneg u$ into a theorem, and leaves $A$ and $A'$ unaffected, hence
            $$vdash A(p_j)to A'(p_j).$$






          share|cite|improve this answer









          $endgroup$








          • 2




            $begingroup$
            Ah, it's the second time you make me realize how important the double negation translation can be! I hope next time I'll remember it.
            $endgroup$
            – Gro-Tsen
            7 hours ago










          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "504"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f325511%2ffibers-of-the-morphism-from-the-free-heyting-algebra-to-the-free-boolean-algebra%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          10












          $begingroup$

          $leteqleftrightarrow$Notice that $psi(A)=u$ iff $vdash_mathrmCPCAeq u$ iff $vdash_mathrmIPCnegneg(Aeq u)$. (I will write just $vdash$ for $vdash_mathrmIPC$.) Thus:



          • $bot$ has a one-element fiber consisting of $bot$: if $vdashnegneg(Aeqbot)$, then $vdashneg A$.


          • For each $i$, $u_i:=p_ilandbigwedge_jne ineg p_j$ has a two-element fiber consisting of $p_ilandbigwedge_jne ineg p_j$ and $negneg p_ilandbigwedge_jne ineg p_j$: if $vdashnegneg(Aeq u_i)$, then $vdash Atoneg p_j$ for all $jne i$, thus $A$ is equivalent to $bigwedge_jne ineg p_jland A(bot,dots,bot,p_i,bot,dots)$. The formula $A':=A(bot,dots,bot,p_i,bot,dots)$ of one variable also has to imply $negneg p_i$, hence by your analysis of the Rieger–Nishimura lattice, it must be equivalent to $negneg p_i$ or to $p_i$. (It can’t be $bot$.)


          • Likewise, $u=bigwedge_ineg p_i$ has a one-element fibre consisting of $bigwedge_ineg p_i$.


          In the remaining cases, the fiber is infinite:



          • If $u=bigwedge_iin Ip_ilandbigwedge_inotin Ineg p_i$ where $|I|ge2$, fix $jne k$ in $I$. Then the fiber of $u$ includes all formulas of the form $$bigwedge_substackiin I\ine j,kp_ilandbigwedge_inotin Ineg p_iland A(p_j,p_k),$$
            where $A(p_j,p_k)$ is a formula of two variables implying $negneg(p_jland p_k)$ and implied by $p_jland p_k$. That there are infinitely many such formulas follows from the fact that in the universal intuitionistic frame of rank $2$, there are infinitely many points such that the only leaf they see is the one satisfying both variables.


          • If $u$ has $ge2$ satisfying assignments $e,e'$, let $I_a,b$, $a,b=0,1$, be the set of indices of variables assigned to $a$ by $e$, and to $b$ by $e'$. Without loss of generality, $I_0,1nevarnothing$, hence we may fix $jin I_0,1$. Then $psi^-1(u)$ includes all formulas of the form
            $$negneg uland A(p_j)$$
            where $A$ is a formula in one variable such that $vdashnegneg A(p_j)$. All these formulas are inequivalent: if
            $$vdashnegneg uland A(p_j)to A'(p_j),$$
            we may substitute $bot$ for all $p_i$ such that $iin I_0,0$, $top$ for $iin I_1,1$, $p_j$ for $iin I_0,1$, and $neg p_j$ for $iin I_1,0$. This substitution turns $negneg u$ into a theorem, and leaves $A$ and $A'$ unaffected, hence
            $$vdash A(p_j)to A'(p_j).$$






          share|cite|improve this answer









          $endgroup$








          • 2




            $begingroup$
            Ah, it's the second time you make me realize how important the double negation translation can be! I hope next time I'll remember it.
            $endgroup$
            – Gro-Tsen
            7 hours ago















          10












          $begingroup$

          $leteqleftrightarrow$Notice that $psi(A)=u$ iff $vdash_mathrmCPCAeq u$ iff $vdash_mathrmIPCnegneg(Aeq u)$. (I will write just $vdash$ for $vdash_mathrmIPC$.) Thus:



          • $bot$ has a one-element fiber consisting of $bot$: if $vdashnegneg(Aeqbot)$, then $vdashneg A$.


          • For each $i$, $u_i:=p_ilandbigwedge_jne ineg p_j$ has a two-element fiber consisting of $p_ilandbigwedge_jne ineg p_j$ and $negneg p_ilandbigwedge_jne ineg p_j$: if $vdashnegneg(Aeq u_i)$, then $vdash Atoneg p_j$ for all $jne i$, thus $A$ is equivalent to $bigwedge_jne ineg p_jland A(bot,dots,bot,p_i,bot,dots)$. The formula $A':=A(bot,dots,bot,p_i,bot,dots)$ of one variable also has to imply $negneg p_i$, hence by your analysis of the Rieger–Nishimura lattice, it must be equivalent to $negneg p_i$ or to $p_i$. (It can’t be $bot$.)


          • Likewise, $u=bigwedge_ineg p_i$ has a one-element fibre consisting of $bigwedge_ineg p_i$.


          In the remaining cases, the fiber is infinite:



          • If $u=bigwedge_iin Ip_ilandbigwedge_inotin Ineg p_i$ where $|I|ge2$, fix $jne k$ in $I$. Then the fiber of $u$ includes all formulas of the form $$bigwedge_substackiin I\ine j,kp_ilandbigwedge_inotin Ineg p_iland A(p_j,p_k),$$
            where $A(p_j,p_k)$ is a formula of two variables implying $negneg(p_jland p_k)$ and implied by $p_jland p_k$. That there are infinitely many such formulas follows from the fact that in the universal intuitionistic frame of rank $2$, there are infinitely many points such that the only leaf they see is the one satisfying both variables.


          • If $u$ has $ge2$ satisfying assignments $e,e'$, let $I_a,b$, $a,b=0,1$, be the set of indices of variables assigned to $a$ by $e$, and to $b$ by $e'$. Without loss of generality, $I_0,1nevarnothing$, hence we may fix $jin I_0,1$. Then $psi^-1(u)$ includes all formulas of the form
            $$negneg uland A(p_j)$$
            where $A$ is a formula in one variable such that $vdashnegneg A(p_j)$. All these formulas are inequivalent: if
            $$vdashnegneg uland A(p_j)to A'(p_j),$$
            we may substitute $bot$ for all $p_i$ such that $iin I_0,0$, $top$ for $iin I_1,1$, $p_j$ for $iin I_0,1$, and $neg p_j$ for $iin I_1,0$. This substitution turns $negneg u$ into a theorem, and leaves $A$ and $A'$ unaffected, hence
            $$vdash A(p_j)to A'(p_j).$$






          share|cite|improve this answer









          $endgroup$








          • 2




            $begingroup$
            Ah, it's the second time you make me realize how important the double negation translation can be! I hope next time I'll remember it.
            $endgroup$
            – Gro-Tsen
            7 hours ago













          10












          10








          10





          $begingroup$

          $leteqleftrightarrow$Notice that $psi(A)=u$ iff $vdash_mathrmCPCAeq u$ iff $vdash_mathrmIPCnegneg(Aeq u)$. (I will write just $vdash$ for $vdash_mathrmIPC$.) Thus:



          • $bot$ has a one-element fiber consisting of $bot$: if $vdashnegneg(Aeqbot)$, then $vdashneg A$.


          • For each $i$, $u_i:=p_ilandbigwedge_jne ineg p_j$ has a two-element fiber consisting of $p_ilandbigwedge_jne ineg p_j$ and $negneg p_ilandbigwedge_jne ineg p_j$: if $vdashnegneg(Aeq u_i)$, then $vdash Atoneg p_j$ for all $jne i$, thus $A$ is equivalent to $bigwedge_jne ineg p_jland A(bot,dots,bot,p_i,bot,dots)$. The formula $A':=A(bot,dots,bot,p_i,bot,dots)$ of one variable also has to imply $negneg p_i$, hence by your analysis of the Rieger–Nishimura lattice, it must be equivalent to $negneg p_i$ or to $p_i$. (It can’t be $bot$.)


          • Likewise, $u=bigwedge_ineg p_i$ has a one-element fibre consisting of $bigwedge_ineg p_i$.


          In the remaining cases, the fiber is infinite:



          • If $u=bigwedge_iin Ip_ilandbigwedge_inotin Ineg p_i$ where $|I|ge2$, fix $jne k$ in $I$. Then the fiber of $u$ includes all formulas of the form $$bigwedge_substackiin I\ine j,kp_ilandbigwedge_inotin Ineg p_iland A(p_j,p_k),$$
            where $A(p_j,p_k)$ is a formula of two variables implying $negneg(p_jland p_k)$ and implied by $p_jland p_k$. That there are infinitely many such formulas follows from the fact that in the universal intuitionistic frame of rank $2$, there are infinitely many points such that the only leaf they see is the one satisfying both variables.


          • If $u$ has $ge2$ satisfying assignments $e,e'$, let $I_a,b$, $a,b=0,1$, be the set of indices of variables assigned to $a$ by $e$, and to $b$ by $e'$. Without loss of generality, $I_0,1nevarnothing$, hence we may fix $jin I_0,1$. Then $psi^-1(u)$ includes all formulas of the form
            $$negneg uland A(p_j)$$
            where $A$ is a formula in one variable such that $vdashnegneg A(p_j)$. All these formulas are inequivalent: if
            $$vdashnegneg uland A(p_j)to A'(p_j),$$
            we may substitute $bot$ for all $p_i$ such that $iin I_0,0$, $top$ for $iin I_1,1$, $p_j$ for $iin I_0,1$, and $neg p_j$ for $iin I_1,0$. This substitution turns $negneg u$ into a theorem, and leaves $A$ and $A'$ unaffected, hence
            $$vdash A(p_j)to A'(p_j).$$






          share|cite|improve this answer









          $endgroup$



          $leteqleftrightarrow$Notice that $psi(A)=u$ iff $vdash_mathrmCPCAeq u$ iff $vdash_mathrmIPCnegneg(Aeq u)$. (I will write just $vdash$ for $vdash_mathrmIPC$.) Thus:



          • $bot$ has a one-element fiber consisting of $bot$: if $vdashnegneg(Aeqbot)$, then $vdashneg A$.


          • For each $i$, $u_i:=p_ilandbigwedge_jne ineg p_j$ has a two-element fiber consisting of $p_ilandbigwedge_jne ineg p_j$ and $negneg p_ilandbigwedge_jne ineg p_j$: if $vdashnegneg(Aeq u_i)$, then $vdash Atoneg p_j$ for all $jne i$, thus $A$ is equivalent to $bigwedge_jne ineg p_jland A(bot,dots,bot,p_i,bot,dots)$. The formula $A':=A(bot,dots,bot,p_i,bot,dots)$ of one variable also has to imply $negneg p_i$, hence by your analysis of the Rieger–Nishimura lattice, it must be equivalent to $negneg p_i$ or to $p_i$. (It can’t be $bot$.)


          • Likewise, $u=bigwedge_ineg p_i$ has a one-element fibre consisting of $bigwedge_ineg p_i$.


          In the remaining cases, the fiber is infinite:



          • If $u=bigwedge_iin Ip_ilandbigwedge_inotin Ineg p_i$ where $|I|ge2$, fix $jne k$ in $I$. Then the fiber of $u$ includes all formulas of the form $$bigwedge_substackiin I\ine j,kp_ilandbigwedge_inotin Ineg p_iland A(p_j,p_k),$$
            where $A(p_j,p_k)$ is a formula of two variables implying $negneg(p_jland p_k)$ and implied by $p_jland p_k$. That there are infinitely many such formulas follows from the fact that in the universal intuitionistic frame of rank $2$, there are infinitely many points such that the only leaf they see is the one satisfying both variables.


          • If $u$ has $ge2$ satisfying assignments $e,e'$, let $I_a,b$, $a,b=0,1$, be the set of indices of variables assigned to $a$ by $e$, and to $b$ by $e'$. Without loss of generality, $I_0,1nevarnothing$, hence we may fix $jin I_0,1$. Then $psi^-1(u)$ includes all formulas of the form
            $$negneg uland A(p_j)$$
            where $A$ is a formula in one variable such that $vdashnegneg A(p_j)$. All these formulas are inequivalent: if
            $$vdashnegneg uland A(p_j)to A'(p_j),$$
            we may substitute $bot$ for all $p_i$ such that $iin I_0,0$, $top$ for $iin I_1,1$, $p_j$ for $iin I_0,1$, and $neg p_j$ for $iin I_1,0$. This substitution turns $negneg u$ into a theorem, and leaves $A$ and $A'$ unaffected, hence
            $$vdash A(p_j)to A'(p_j).$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered 9 hours ago









          Emil JeřábekEmil Jeřábek

          30k388140




          30k388140







          • 2




            $begingroup$
            Ah, it's the second time you make me realize how important the double negation translation can be! I hope next time I'll remember it.
            $endgroup$
            – Gro-Tsen
            7 hours ago












          • 2




            $begingroup$
            Ah, it's the second time you make me realize how important the double negation translation can be! I hope next time I'll remember it.
            $endgroup$
            – Gro-Tsen
            7 hours ago







          2




          2




          $begingroup$
          Ah, it's the second time you make me realize how important the double negation translation can be! I hope next time I'll remember it.
          $endgroup$
          – Gro-Tsen
          7 hours ago




          $begingroup$
          Ah, it's the second time you make me realize how important the double negation translation can be! I hope next time I'll remember it.
          $endgroup$
          – Gro-Tsen
          7 hours ago

















          draft saved

          draft discarded
















































          Thanks for contributing an answer to MathOverflow!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f325511%2ffibers-of-the-morphism-from-the-free-heyting-algebra-to-the-free-boolean-algebra%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          acmart: Multiple authors: all with same affiliation, one author an additional affiliationHow to Write Names of Multiple Authors with Shared Affiliation in ACM 2017 Template?Multiple authors with different primary affiliation, but same additional affiliationSame affiliation for all authors without extra packagesIOS-Book-Article.cls: one author with multiple affiliationacmart: Shared Author AffiliationMultiple authors with different primary affiliation, but same additional affiliationAuthor affiliation with only 1 authorAdding Multiple Authors with Different Affiliation in LaTeX ArticleLaTeX: Multiple authors stays on same lineHow to Label Multiple Authors with Same DescriptionHow to make two authors use the same affiliationTwo authors with same affiliation on finished front page

          How to write “ä” and other umlauts and accented letters in bibliography?Accents in BibTeXSorting references with special characters alphabeticallyUse ae ligature in bibliographyEastern European nameInverted circumflex in BibTexBibTex, non-ascii initials and nameptr fproblems with accent in LatexHow to add a Ø to my bibliography from Jabref?References without accentsTroubles when trying to cite St“omer-Verlet in ”title" field of a bib entryComprehensive list of accented charactersHow to type the letter “i” with two dots (diaeresis) in math mode?Problem with glossary text and accented lettersSpecial character in bibliographyAccented letters, Unicode and LaTeX accentsHow to stop natbib from modifying bibliography styleCitation of a paper with non-standard characters by BibtexWrite accented characters to file using writeHow to group the bibliography alphabetically, if some surnames start with “accented” characters?How can I automatically capitalize significant words in my bibliography?

          How to remove border form elements in the last row?Targeting flex items on the last rowHow to vertically wrap content with flexbox?Remove border from IFrameCSS3's border-radius property and border-collapse:collapse don't mix. How can I use border-radius to create a collapsed table with rounded corners?Div width 100% minus fixed amount of pixelsBorder around specific rows in a table?How to remove border (outline) around text/input boxes? (Chrome)How do I remove the space between inline-block elements?Flex-box: Align last row to gridRemove blue border from css custom-styled button in ChromeFill remaining vertical space with CSS using display:flexhow style elements in the last row of flexbox row layout with pure css without js