How to resolve the algorithm Ternary logic step by step in the Forth programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Ternary logic step by step in the Forth programming language

Table of Contents

Problem Statement

In logic, a three-valued logic (also trivalent, ternary, or trinary logic, sometimes abbreviated 3VL) is any of several many-valued logic systems in which there are three truth values indicating true, false and some indeterminate third value.
This is contrasted with the more commonly known bivalent logics (such as classical sentential or boolean logic) which provide only for true and false. Conceptual form and basic ideas were initially created by Łukasiewicz, Lewis and Sulski. These were then re-formulated by Grigore Moisil in an axiomatic algebraic form, and also extended to n-valued logics in 1945.

Note:   Setun   (Сетунь) was a   balanced ternary   computer developed in 1958 at   Moscow State University.   The device was built under the lead of   Sergei Sobolev   and   Nikolay Brusentsov.   It was the only modern   ternary computer,   using three-valued ternary logic

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Ternary logic step by step in the Forth programming language

Source code in the forth programming language

1 constant maybe

: tnot dup maybe <> if invert then ;
: tand and ;
: tor or ;
: tequiv 2dup and rot tnot rot tnot and or ;
: timply tnot tor ;
: txor tequiv tnot ;

: t. C" TF?" 2 + + c@ emit ;

: table2. ( xt -- )
  cr ."     T F ?"
  cr ."   --------"
  2 true DO
    cr I t.  ."  | "
    2 true DO
      dup I J rot execute t. ."  "
    LOOP
  LOOP DROP ;

: table1. ( xt -- )
  2 true DO
    CR I t. ."  | "
    dup I swap execute t.
  LOOP DROP ;

CR ." [NOT]" ' tnot table1. CR
CR ." [AND]" ' tand table2. CR
CR ." [OR]" ' tor table2. CR
CR ." [XOR]" ' txor table2. CR
CR ." [IMPLY]" ' timply table2. CR
CR ." [EQUIV]" ' tequiv table2. CR


  

You may also check:How to resolve the algorithm Longest increasing subsequence step by step in the OCaml programming language
You may also check:How to resolve the algorithm Roots of unity step by step in the C# programming language
You may also check:How to resolve the algorithm User input/Text step by step in the 11l programming language
You may also check:How to resolve the algorithm Tree datastructures step by step in the Nim programming language
You may also check:How to resolve the algorithm Munchausen numbers step by step in the 8080 Assembly programming language