Category Archives: Model Theory

¿Shifting Paradigms? • 5

Posted on July 16, 2017 by Jon Awbrey

Re: Peter Cameron • Infinity and Foundation We always encounter a multitude of problems whenever we try to rationalize mathematics by reducing it to logic, where logic itself is reduced to a purely deductive style.  A number of thinkers have … Continue reading →

Posted in Algorithms, Boole, C.S. Peirce, Combinatorics, Computation, Foundations of Mathematics, Inquiry, Laws of Form, Leibniz, Logic, Mathematics, Model Theory, Paradigms, Peirce, Proof Theory, Spencer Brown | Tagged , , , , , , , , , , , , , , , | 4 Comments

Animated Logical Graphs • 10

Posted on March 3, 2017 by Jon Awbrey

Re: Peirce List Discussion • Charles Pyle Let’s consider Peirce’s logical graphs at the alpha level, the abstract forms of which can be interpreted for propositional logic.  I say “can be interpreted” advisedly because the system of logical graphs itself … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 11 Comments

Homunculomorphisms • 2

Posted on February 12, 2016 by Jon Awbrey

Re: John Baez • The Internal Model Principle There’s a far-ranging discussion that takes off from this point, touching on links among analogical reasoning, arrows and functors, cybernetic images, iconic versus symbolic representations, mental models, systems simulations, etc., and just … Continue reading →

Posted in Analogy, Ashby, Automata, Control Systems, Cybernetics, Homunculi, Homunculomorphisms, Iconicity, Information Theory, Inquiry, Inquiry Driven Systems, Intentionality, Internal Models, Logic, Logic of Science, Mathematics, Mental Models, Model Theory, Optimal Control, Peirce, Semiotics, Systems Theory, Triadic Relations | Tagged , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Problems In Philosophy • 3

Posted on February 8, 2016 by Jon Awbrey

Re: R.D. Mounce Making reality our friend is necessary to survival and finding good descriptions of reality is the better part of doing that, so I don’t imagine we have any less interest in truth than the Ancients.  From what … Continue reading →

Posted in Aesthetics, Computation, Computer Science, Ethics, Heap Problem, Logic, Mathematics, Model Theory, Normative Science, Paradox, Peirce, Philosophy, Pragmatism, Problem Solving, Proof Theory, Sorites | Tagged , , , , , , , , , , , , , , , | Leave a comment

Problems In Philosophy • 2

Posted on February 8, 2016 by Jon Awbrey

Re: R.J. Lipton and K.W. Regan • You Think We Have Problems Classical tradition views logic as a normative science, one whose object is truth.  This puts logic on a par with ethics, whose object is justice or morality in … Continue reading →

Posted in Aesthetics, Algorithms, Animata, Automata, Beauty, C.S. Peirce, Ethics, Inquiry, Justice, Logic, Model Theory, Normative Science, Peirce, Philosophy, Pragmatism, Problem Solving, Proof Theory, Summum Bonum, Truth, Virtue | Tagged , , , , , , , , , , , , , , , , , , , | 3 Comments

Animated Logical Graphs • 9

Posted on May 24, 2015 by Jon Awbrey

Re: Ken Regan • The Shapes of Computations The insight it takes to find a succinct axiom set for a theoretical domain falls under the heading of abductive or retroductive reasoning, a knack as yet refractory to computational attack, but … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 11 Comments

Animated Logical Graphs • 8

Posted on May 23, 2015 by Jon Awbrey

Re: Ken Regan • The Shapes of Computations The most striking example of a “Primitive Insight Proof” (PIP❢) known to me is the Dawes–Utting proof of the Double Negation Theorem from the CSP–GSB axioms for propositional logic.  There is a … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 12 Comments

Animated Logical Graphs • 7

Posted on May 22, 2015 by Jon Awbrey

Re: Ken Regan • The Shapes of Computations There are several issues of computation shape and proof style that raise their heads already at the logical ground level of boolean functions and propositional calculus.  From what I’ve seen, there are … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 12 Comments

Animated Logical Graphs • 6

Posted on March 13, 2015 by Jon Awbrey

Re: Peirce List • 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 all … Continue reading →

Posted in Amphecks, Analogy, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Graph Theory, Iconicity, Laws of Form, Logic, Logical Graphs, Mathematics, Model Theory, Peirce, Peirce's Law, Praeclarum Theorema, Pragmatism, Proof Theory, Propositional Calculus, Semiotics, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 12 Comments

Animated Logical Graphs • 5

Posted on January 28, 2015 by Jon Awbrey

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 →

Posted in Abstraction, Amphecks, Analogy, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Deduction, Diagrammatic Reasoning, Duality, Form, Graph Theory, Iconicity, Laws of Form, Leibniz, Logic, Logical Graphs, Mathematics, Model Theory, Peirce, Peirce's Law, Praeclarum Theorema, Pragmatism, Proof Theory, Propositional Calculus, Semiotics, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 12 Comments