Re: Interfacing Ada With Full Runtime Directly to Electronic Chips

[Shark8 <onewingedshark@gmail.com>]

On Tuesday, January 3, 2017 at 1:34:31 PM UTC-7, Dmitry A. Kazakov wrote:
> On 2017-01-03 19:02, Shark8 wrote:
> > On Tuesday, January 3, 2017 at 3:34:33 AM UTC-7, Dmitry A. Kazakov wrote:
> >> On 2017-01-03 06:33, Shark8 wrote:
> >>
> >>> That's really interesting, because the system I want to do
> >>> [ultimately] is a ternary computer -- for which tri-state logic is a
> >>> perfect fit.
> >>
> >> Out of curiosity, why tri-state logic and not full four-state one?
> >> Tri-state is incomplete in some operations (e.g. in implication).
> >
> > The completeness of the logic-system depends on which logic-system
> > is  being used -- there are several for three-valued logic -- but it is a
> > non-issue because you can use full Boolean logic (e.g.) by defining 0 to
> > be True and ±1 to be False (i.e. using inverse-logic).*
> 
> [...]
> 
> I see, it is just a ternary system and not logic in the sense of lattice 
> and inference, like {False, True, Unknown}.

You can model True/False/Unknown -- just map each value to one of {1,0,J}, obviously.

But how would a lattice & inference system look? Esp. at the gate-level.