12,080
edits
Changes
MyWikiBiz, Author Your Legacy — Tuesday April 15, 2025
Jump to navigationJump to searchDirectory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6 (view source)
Revision as of 03:41, 24 February 2013
, 03:41, 24 February 2013→6.37. Propositional Types: markup
Line 9,353:
Line 9,353:
In this section, I describe a formal system of "type expressions" that are analogous to formulas of propositional logic, and I discuss their use as a calculus of predicates for classifying, analyzing, and drawing typical inferences about n place relations, in particular, for reasoning about the results of operations indicated or performed on relations and about the properties of their transformations and combinations.
−
===6.37. Propositional Types===
===6.37. Propositional Types===
+
+In this Section I describe a formal system of ''type expressions'' that are analogous to formulas of propositional logic, and I discuss their use as a calculus of predicates for classifying, analyzing, and drawing typical inferences about <math>n\!</math>-place relations, in particular, for reasoning about the results of operations indicated or performed on relations and about the properties of their transformations and combinations.
<pre>
<pre>
−Definition. Given a cartesian product XxY, an ordered pair <x, y> C XxY has the type S.T, written <x, y> : S.T, iff x C S c X and y C T c Y. Notice that an ordered pair can have many types.
Definition. Given a cartesian product XxY, an ordered pair <x, y> C XxY has the type S.T, written <x, y> : S.T, iff x C S c X and y C T c Y. Notice that an ordered pair can have many types.
