12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Friday November 22, 2024
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems (view source)
Revision as of 17:34, 27 April 2013
, 17:34, 27 April 2013→Formal extension : Cactus calculus: add [additional evaluation rules]
The first extension is the ''reflective extension of logical graphs'', or what may be described as the ''cactus language'', after its principal graph-theoretic data structure. It is generated by generalizing the negation operator <math>\texttt{(\_)}</math> in a particular manner, treating <math>\texttt{(\_)}</math> as the ''[[minimal negation operator]]'' of order 1, and adding another such operator for each integer parameter greater than 1. Taken in series, the minimal negation operators are symbolized by parenthesized argument lists of the following shapes: <math>\texttt{(\_)},</math> <math>\texttt{(\_, \_)},</math> <math>\texttt{(\_, \_, \_)},</math> and so on, where the number of argument slots is the order of the reflective negation operator in question.
The first extension is the ''reflective extension of logical graphs'', or what may be described as the ''cactus language'', after its principal graph-theoretic data structure. It is generated by generalizing the negation operator <math>\texttt{(\_)}</math> in a particular manner, treating <math>\texttt{(\_)}</math> as the ''[[minimal negation operator]]'' of order 1, and adding another such operator for each integer parameter greater than 1. Taken in series, the minimal negation operators are symbolized by parenthesized argument lists of the following shapes: <math>\texttt{(\_)},</math> <math>\texttt{(\_, \_)},</math> <math>\texttt{(\_, \_, \_)},</math> and so on, where the number of argument slots is the order of the reflective negation operator in question.
===Fundamental evaluation rule===
The formal rule of evaluation for a <math>k\!</math>''-lobe'' or <math>k\!</math>-operator may be summarized as follows:
The formal rule of evaluation for a <math>k\!</math>''-lobe'' or <math>k\!</math>-operator may be summarized as follows:
| (24)
| (24)
|}
|}
===Additional evaluation rules===
==Case analysis-synthesis theorem==
==Case analysis-synthesis theorem==
