User:IssaRice/Logical induction notation

This is in user space because it's not really about machine learning.

Term	Notation	Type	Definition	Notes
$\mathcal{F}$-combination	$A$	$\mathcal{S}\cup \{0,1\}\to {\mathcal{F}}_n$		Function application of an $\mathcal{F}$-combination uses square brackets instead of parentheses. Why? As far as I can tell, this is because each coefficient is in $\mathcal{F}$ so is itself a function. This means we have two senses of "application": we can pick out the specific coefficient we want (square brackets), or we can apply each coefficient to return something (parentheses).
Holdings from $T$ against $\overline{\mathbb{P}}$ (a $\mathbb{Q}$-combination)	$T(\overline{\mathbb{P}})$	$\mathcal{S}\cup \{0,1\}\to \mathbb{Q}$

External links

• https://arbital.com/p/logical_inductor_nota/
• https://arbital.com/p/logical_induction/