Category Archives: Boolean Functions

Frankl, My Dear • 2

Posted on September 11, 2014 by Jon Awbrey

Re: Dick Lipton & Ken Regan • (1) • (2) Supplied by the cache of definitions from Post 1, I can return to the passage from (2) that seemed to jog a bit of memory and see if what I imagined … Continue reading →

Posted in Boolean Algebra, Boolean Functions, Computational Complexity, Differential Logic, Frankl Conjecture, Logic, Logical Graphs, Mathematics, Péter Frankl | Tagged , , , , , , , , | 10 Comments

Frankl, My Dear • 1

Posted on September 7, 2014 by Jon Awbrey

Re: Dick Lipton and Ken Regan • (1) • (2) I need to think a little about the context Lipton and Regan have wrapped around the Frankl Conjecture, if not exactly about the problem itself.  This will be a scratch-worky … Continue reading →

Posted in Boolean Algebra, Boolean Functions, Computational Complexity, Differential Logic, Frankl Conjecture, Logic, Logical Graphs, Mathematics, Péter Frankl | Tagged , , , , , , , , | 11 Comments

All Process, No Paradox • 6

Posted on January 22, 2014 by Jon Awbrey

Re: R.J. Lipton • Anti-Social Networks Re: Lou Kauffman • Iterants, Imaginaries, Matrices Comments I made elsewhere about computer science and (anti-)social networks have a connection with the work in progress on this thread, so it may steal a march … Continue reading →

Posted in Algorithms, Amphecks, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cybernetics, Differential Logic, Graph Theory, Laws of Form, Logic, Logical Graphs, Lou Kauffman, Mathematics, Minimal Negation Operators, Painted Cacti, Paradox, Peirce, Process Thinking, Propositional Calculus, Spencer Brown, Systems, Time | Tagged , , , , , , , , , , , , , , , , , , , , , , | 10 Comments

All Process, No Paradox • 2

Posted on January 15, 2014 by Jon Awbrey

These are the forms of time, which imitates eternity and revolves according to a law of number. Plato • Timaeus Re: Lou Kauffman • Iterants, Imaginaries, Matrices As serendipity would have it, Lou Kauffman, who knows a lot about the … Continue reading →

Posted in Animata, Boolean Functions, C.S. Peirce, Cybernetics, Differential Logic, Discrete Dynamics, Laws of Form, Logic, Logical Graphs, Lou Kauffman, Mathematics, Paradox, Peirce, Plato, Process, Spencer Brown, Timaeus, Time | Tagged , , , , , , , , , , , , , , , , , | 11 Comments

“What we’ve got here is (a) failure to communicate” • 6

Posted on November 15, 2013 by Jon Awbrey

Excerpt from Warren S. McCulloch, “What Is a Number, that a Man May Know It, and a Man, that He May Know a Number?” (1960) Please remember that we are not now concerned with the physics and chemistry, the anatomy … Continue reading →

Posted in Abduction, Amphecks, Aristotle, Automata, Boolean Algebra, Boolean Functions, C.S. Peirce, Combinatorics, Deduction, Duns Scotus, Induction, Leibniz, Logic, Logic of Relatives, Mathematics, Neural Models, Ockham, Peirce, Propositional Logic, Psychons, Relation Theory, Sources, Triadic Relations, Warren S. McCulloch, William James | Tagged , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Differential Analytic Turing Automata • Discussion 1

Posted on October 14, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Proving Cook’s Theorem Synchronicity Rules❢ I just started reworking an old exposition of mine on Cook’s Theorem, where I borrowed the Parity Function example from Wilf (1986), Algorithms and Complexity, and translated it … Continue reading →

Posted in Algorithms, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Differential Analytic Turing Automata, Differential Logic, Logic, Logical Graphs, Peirce, Propositional Calculus, Turing Machines | Tagged , , , , , , , , , , , | 2 Comments

How To Succeed In Proof Business Without Really Trying

Posted on July 15, 2013 by Jon Awbrey

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 →

Posted in Algorithms, Animata, Artificial Intelligence, Automatic Theorem Proving, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Computational Complexity, Graph Theory, Logic, Logical Graphs, Minimal Negation Operators, Model Theory, Peirce, Praeclarum Theorema, Proof Theory, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , , , , , , , , | 7 Comments

Fourier Transforms of Boolean Functions • 2

Posted on June 4, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Twin Primes Are Useful Note.  Just another sheet of scratch paper, exploring possible alternatives to the Fourier transforms in the previous post.  As a rule, I like to keep Boolean problems in Boolean … Continue reading →

Posted in Boolean Functions, Computational Complexity, Fourier Transforms, Harmonic Analysis, Logic, Mathematics, Propositional Calculus | Tagged , , , , , , | Leave a comment

Special Classes of Propositions

Posted on May 31, 2013 by Jon Awbrey

Adapted from Differential Propositional Calculus • Special Classes of Propositions A basic proposition, coordinate proposition, or simple proposition in the universe of discourse is one of the propositions in the set Among the propositions in are several families of propositions … Continue reading →

Posted in Boolean Functions, Computational Complexity, Differential Logic, Equational Inference, Functional Logic, Indication, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Propositional Calculus, Visualization | Tagged , , , , , , , , , , , | 2 Comments

Fourier Transforms of Boolean Functions • 1

Posted on May 30, 2013 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • Twin Primes Are Useful The problem is concretely about Boolean functions of variables, and seems not to involve prime numbers at all. For any subset of the coordinate [indices], the corresponding Fourier coefficient … Continue reading →

Posted in Boolean Functions, Computational Complexity, Fourier Transforms, Harmonic Analysis, Logic, Mathematics, Propositional Calculus | Tagged , , , , , , | 1 Comment