12,080
edits
Changes
Directory:Jon Awbrey/Essays/Prospects For Inquiry Driven Systems (view source)
Revision as of 19:30, 21 January 2008
, 19:30, 21 January 2008→3.1.1.3. Vacuous Connectives and Constant Values: formats
=====3.1.1.3. Vacuous Connectives and Constant Values=====
=====3.1.1.3. Vacuous Connectives and Constant Values=====
As a consistent downward extension, the nullary (or 0-ary) connectives can be identified with logical constants. That is, blank expressions " " are taken for the value "true" (silence assents), and empty bounds "()" are taken for the value "false". By composing operations, negation and binary conjunction are enough in themselves to obtain all the other boolean functions, but the use of these k-ary connectives lends itself to a flexible and powerful representation as graph-theoretical data-structures in the computer.
As a consistent downward extension, the nullary (or 0-ary) connectives can be identified with logical constants. That is, blank expressions " " are taken for the value ''true'' ("silence assents"), and empty bounds "( )" are taken for the value ''false''. By composing operations, negation and binary conjunction are enough in themselves to obtain all the other boolean functions, but the use of these ''k''-ary connectives lends itself to a flexible and powerful representation as graph-theoretical data-structures in the computer.
====3.1.2. Implementation Details====
====3.1.2. Implementation Details====