unleashing my inner mad scientist on symbolic logic
blog logic puzzles piward coding
๐Ÿฒ / ๐Ÿ›๐Ÿ˜ยท I'm generalizing the way I validate proof steps so inference rules match if any formulae with an equivalent (Sapphire specific) normal form would have matched.
๐Ÿณ / ๐Ÿ˜๐Ÿšยท This page is a rough (perhaps embarrassingly so) version of a solution to the first puzzle in Raymond M. Smullyan's Satan, Cantor and Infinity
1 ๐Ÿฎ ๐Ÿ˜๐Ÿžยท I now have a somewhat general "pigeonhole solver" which, given a set of equations of the form x_iยฌ=x_j and for each x_i, one equation of the form x_iโˆˆ{c_j c_(j+1)
โ”Š c_(j+2) ... c_(j+k)}. This can directly be solved with a search, but I've been trying to avoid that in my pretense toward symbolic manipulation. In the end, I'm not
โ•ฐ sure my approach is all that different than a search - if I can write my approach up in a sensible form, I'll post a doc someplace and hope to learn more.