Operator Precedence/Boolean Logic

[Rustom Mody]

Earlier you said:

> > 1. Graphs -- the kind mathematicians define with "Let G =(V,E) be a
> > graph..."
>  
> I would make the empty graph (zero nodes) falsey, and non-empty graphs (one
> or more nodes) truthy.
>  
>  
> > 2. Automata which in a way are special kinds of graphs
>  
> As above.


Now you say:

> > If on the other hand you are giving that “return True”as a serious useful
> > definition?
>  
> Sure. An automata is an object, and by default, all objects are "something"
> and hence truthy. That's the "no-brainer" answer, it requires no
> justification at all. If you think the answer should be something else,
> *that* is what needs justification. Why shouldn't it be truthy? 


How do we put these two together?

Maybe thusly?
https://en.wikibooks.org/wiki/Sufism/Nasrudin#Of_any_two_options_choose_the_third