# Category Archives: Praeclarum Theorema

## Animated Logical Graphs • 6

Re: Peirce List Discussion • Jim Willgoose At root we are dealing with a genre of very abstract formal systems.  They have grammars that determine their well-formed expressions and rules that determine the permissible transformations among expressions, but they lack … Continue reading

## Animated Logical Graphs • 5

Re: Peirce List Discussion • HP A computational problem is defined as a set of problem instances with specified properties.  An algorithm solves a problem if it computes the correct answer to every problem instance in that set. The use … Continue reading

## Animated Logical Graphs • 4

Re: Peirce List Discussion • HR Although it’s fair to say that most of my university coursework leaned to the theoretical side of things, I did cobble together a respectable enough background in computing, statistics, and industrial-organizational styles of systems … Continue reading

## Animated Logical Graphs • 3

Re: Peirce List • Helmut Raulien I have a little more leisure now to start climbing back into the saddle, so let me see where we left off … Try looking into the article I linked before: Logical Graphs Or … Continue reading

## Animated Logical Graphs • 2

Re: Peirce List • Jim Willgoose It’s almost 50 years now since I first encountered the volumes of Peirce’s Collected Papers in the math library at Michigan State, and shortly afterwards a friend called my attention to the entry for … Continue reading

## Animated Logical Graphs • 1

For Your Musement … Here are some animations I made up to illustrate several different styles of proof in an extended topological variant of Peirce’s Alpha Graphs for propositional logic. ☞ Proof Animations See the following article for a full … Continue reading

## How To Succeed In Proof Business Without Really Trying

Re: R.J. Lipton • Surely You Are Joking? Comment 1 Even at the mailroom entry point of propositional calculus, there is a qualitative difference between insight proofs and routine proofs.  Human beings can do either sort, as a rule, but … Continue reading

## Praeclarum Theorema

The praeclarum theorema, or splendid theorem, is a theorem of propositional calculus that was noted and named by G.W. Leibniz. Continue reading