How much is known about the "inference rules" of logical induction?

Updating on the observations "ϕ(n) for all 0≤n≤N", the probability of ∀nϕ(n) goes to 1 as N→∞

Logical induction doesn't have this property. No alternatives can either.

To make sense of this answer, I recommend reading

https://www.lesswrong.com/posts/3FoMuCLqZggTxoC3S/logical-pinpointing [LW · GW]

and

https://www.lesswrong.com/posts/i7oNcHR3ZSnEAM29X/standard-and-nonstandard-numbers [LW · GW]

In short, logical induction can't be sure if its operating in a nonstandard context or not. So suppose that $\varphi$ is true for all standard numbers, but false for some nonstandard number. Logical Induction has no way to know whether it is operating in the standard or non-standard numbers, so assigns a probability strictly between 0 and 1 to it.

Suppose you had an alternate algorithm that didn't do that. A Turing machine can be formally specified in PA, so we can talk about the output of the algorithm. The concept of limits can be discussed in PA using $\forall ϵ\exists \delta$ of foundational calculus. (The $ϵ$ and $\delta$ actually need to be Natural numbers, but you can encode rational numbers in them with prime factors)

So for every formula $\varphi$ in PA there exists another formula ${\varphi }^{\prime }$ that says that your algorithm assigns probability 1 to $\varphi$ in the limit. (And ${\varphi }^{\prime }$ is computable from $\varphi$)

Let $K$ be a PA formula with one free variable. $K$ takes in a number $a$. If $a$ does not encode a PA formula with one free variable, then $K$ is false. If $a$ encodes $A$, then $K=\neg \left(A\right(a){)}^{\prime }$. Now consider $k$ an integer encoding $K$. And consider $K\left(k\right)$ .

This is a straightforward modification of godels incompleteness theorem. If you have any procedure that can perfectly distinguish between true and false statements within the structure of PA, then you can make a "this statement is false" and get a contradiction.

Technical Note. I am also assuming that your proposed alternative to logical induction respects negation and implication in the limit. (Ie if ${lim}_{n\to \infty }P\left(\psi \right)=1⟺{lim}_{n\to \infty }P\left(\neg \psi \right)=0$ and $\left({lim}_{n\to \infty }P\right(\psi )=1\wedge {lim}_{n\to \infty }P(\psi ⟹\varphi )=1)⟹{lim}_{n\to \infty }P\left(\varphi \right)=1$ .)

Some expressions in PA have multiple qualifiers $\forall a\exists b\forall c...$ Suppose we know that $P\left(\varphi \right(a\left)\right)=1$ for every particular $a$. Then by finite combinations of probabilities, $P(\forall a<N:\varphi (a\left)\right)=1$ and so $P(\forall a:\varphi (a\left)\right)=1$. As $\exists a=\neg \forall a\neg$, then it follows that any attempt at logical induction with this property must fail.

EDIT:

I have realized that I was confusing two separate concepts. You can't have any function from formulas to booleans that has the property $\forall x:f{(}^{\prime }\varphi \left(x{)}^{\prime }\right)⟹f{(}^{\prime }\forall x:\varphi \left(x{)}^{\prime }\right)$. and the trivial preservation of logical operations. (definable within a formal first order theory with the same symbols)

However, if you have a process that returns True, False or Maybe, and is never wrong, then you can extend it to another process like this. Take $f\left(\varphi \right)$ the first function. If $f\left(\varphi \right)$ is True or False, define $g\left(\varphi \right)=f\left(\varphi \right)$ otherwise, if $\varphi =\forall x:\psi \left(x\right)$ and $\forall x:f\left(\psi \right(x\left)\right)$ then $g\left(\varphi \right)$=True. Otherwise Maybe.

You can't always combine infinite sequences of your own beliefs, but you can combine infinite sequences of beliefs from some weaker system, and each time you do that you move further up the arithmetic hierarchy.

https://en.wikipedia.org/wiki/Arithmetical_hierarchy

As totally computable functions are in ${\Delta }_0$, the limit of a sequence of boolean functions is in ${\Sigma }_2$. So as taking a forall over a function makes it a $\Pi$ the highest you can get while still having

Updating on the observations "ϕ(n) for all 0≤n≤N", the probability of ∀nϕ(n) goes to 1 as N→∞

Is ${\Pi }_1$. This means that you can have your asymtotic property compared to any ${\Pi }_1$ function.

Limits in the rationals add a $\forall ϵ>0$ to the front, puting them in ${\Pi }_3$. Meaning that your asymtotic property holds for all ${\Pi }_3$ sets.

What this means is that if you have a computable function $p_x\left(n\right)\in [0,1]$ which tends to 1 as $n\to \infty$ if and only if $\varphi \left(x\right)$ then you can construct $q\left(n\right)={\sum }_{x=1}^n{2}^{-x}{p}_x\left(n\right)$ which tends to 1 if and only if $\forall x:\varphi \left(x\right)$.

The downside of this approach is that it assigns probability almost 1 to false statements.

The boolean function case is to take a function that searches for an explicit counterexample, and return a probability that tends to one if no counter example has been found yet.