Signs Of Signs • 4

Re: Michael HarrisLanguage About Language

But then inevitably I find myself wondering whether a proof assistant, or even a formal system, can make the distinction between “technical” and “fundamental” questions.  There seems to be no logical distinction.  The formalist answer might involve algorithmic complexity, but I don’t think that sheds any useful light on the question.  The materialist answer (often? usually?) amounts to just‑so stories involving Darwin, and lions on the savannah, and maybe an elephant, or at least a mammoth.  I don’t find these very satisfying either and would prefer to find something in between, and I would feel vindicated if it could be proved (in I don’t know what formal system) that the capacity to make such a distinction entails appreciation of music.

Peirce proposed a distinction between corollarial and theorematic reasoning in mathematics which strikes me as similar to the distinction Michael Harris seeks between technical and fundamental questions.

I can’t say I have a lot of insight into how the distinction might be drawn but I recall a number of traditions pointing to the etymology of theorem as having to do with the observation of objects and practices whose depth of detail always escapes full accounting by any number of partial views.

On the subject of music, all I have is the following incidental —

🙞 Riffs and Rotes

Perhaps it takes a number theorist to appreciate it …

Posted in Aesthetics, C.S. Peirce, Category Theory, Coherentism, Communication, Connotation, Form, Formal Languages, Foundations of Mathematics, Higher Order Propositions, Illusion, Inquiry, Inquiry Into Inquiry, Interpretation, Interpretive Frameworks, Logic, Mathematics, Objective Frameworks, Objectivism, Pragmatic Semiotic Information, Pragmatics, Pragmatism, Recursion, Reflection, Semantics, Semiotics, Sign Relations, Syntax, Translation, Triadic Relations, Type Theory | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 3 Comments

Signs Of Signs • 3

Re: Michael HarrisLanguage About Language

And if we don’t [keep our stories straight], who puts us away?

One’s answer, or at least one’s initial response to that question will turn on how one feels about formal realities.  As I understand it, reality is that which persists in thumping us on the head until we get what it’s trying to tell us.  Are there formal realities, forms which drive us in that way?

Discussions like those tend to begin by supposing we can form a distinction between external and internal.  That is a formal hypothesis, not yet born out as a formal reality.  Are there formal realities which drive us to recognize them, to pick them out of a crowd of formal possibilities?

Posted in Aesthetics, C.S. Peirce, Category Theory, Coherentism, Communication, Connotation, Form, Formal Languages, Foundations of Mathematics, Higher Order Propositions, Illusion, Inquiry, Inquiry Into Inquiry, Interpretation, Interpretive Frameworks, Logic, Mathematics, Objective Frameworks, Objectivism, Pragmatic Semiotic Information, Pragmatics, Pragmatism, Recursion, Reflection, Semantics, Semiotics, Sign Relations, Syntax, Translation, Triadic Relations, Type Theory | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Signs Of Signs • 2

Re: Michael HarrisLanguage About Language

I compared mathematics to a “consensual hallucination,” like virtual reality, and I continue to believe that the aim is to get (consensually) to the point where that hallucination is a second nature.

I think that’s called coherentism, normally contrasted with or complementary to objectivism.  It’s the philosophy of a gang of co‑conspirators who think, “We’ll get off scot‑free so long as we all keep our stories straight.”

Posted in Aesthetics, C.S. Peirce, Category Theory, Coherentism, Communication, Connotation, Form, Formal Languages, Foundations of Mathematics, Higher Order Propositions, Illusion, Inquiry, Inquiry Into Inquiry, Interpretation, Interpretive Frameworks, Logic, Mathematics, Objective Frameworks, Objectivism, Pragmatic Semiotic Information, Pragmatics, Pragmatism, Recursion, Reflection, Semantics, Semiotics, Sign Relations, Syntax, Translation, Triadic Relations, Type Theory | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Signs Of Signs • 1

Re: Michael HarrisLanguage About Language

There is a language and a corresponding literature treating logic and mathematics as related species of communication and information gathering, namely, the pragmatic‑semiotic tradition transmitted through the lifelong efforts of C.S. Peirce.  It is by no means a dead language but it continues to fly beneath the radar of many trackers in logic and math today.  Nevertheless, the resource remains for those who wish to look into it.

Posted in Aesthetics, C.S. Peirce, Category Theory, Coherentism, Communication, Connotation, Form, Formal Languages, Foundations of Mathematics, Higher Order Propositions, Illusion, Inquiry, Inquiry Into Inquiry, Interpretation, Interpretive Frameworks, Logic, Mathematics, Objective Frameworks, Objectivism, Pragmatic Semiotic Information, Pragmatics, Pragmatism, Recursion, Reflection, Semantics, Semiotics, Sign Relations, Syntax, Translation, Triadic Relations, Type Theory | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Animated Logical Graphs • 9

Re: Ken ReganThe 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 once we’ve lucked on a select‑enough set of axioms we can develop theorems which afford a more navigable course through the subject.

For example, back on the range of propositional logic, it takes but a few pivotal theorems plus the lever of mathematical induction to derive the Case Analysis-Synthesis Theorem (CAST) that affords a bridge between proof‑theoretic methods demanding a modicum of insight and model‑theoretic methods able to be run routinely.

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

Re: Ken ReganThe 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 graphically illustrated discussion at the following location:

I cannot hazard a guess what order of insight it took to find that proof — for me it would have involved a whole lot of random search through the space of possible proofs, and that’s even if I got the notion to look for one in the first place.

There is of course a much deeper order of insight into the mathematical form of logical reasoning that it took C.S. Peirce to arrive at his maximally elegant 4-axiom set.

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

Re: Ken ReganThe 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 three dimensions of variation that appear most prominent at this stage:

  • Insight Proofs vs. Routine Proofs
  • Model-Theoretic Methods vs. Proof-Theoretic Methods
  • Equational (Information-Preserving) Proofs vs.
    Implicational (Information-Reducing) Proofs

More later, after I dig up some basic examples …

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

Survey of Theme One Program • 1

This is a Survey of blog and wiki posts relating to the Theme One Program I worked on all through the 1980s.  The aim was to develop fundamental algorithms and data structures to support an integrated learning and reasoning interface, looking toward the design of an Automated Research Tool able to double as a medium for Inquiry Driven Education.  I wrote up a pilot version of the program well enough to get a Master’s degree out of it but I’m still getting around to writing up the complete documentation.

Wiki Hub

Documentation in Progress

Applications

References

  • Awbrey, S.M., and Awbrey, J.L. (May 1991), “An Architecture for Inquiry : Building Computer Platforms for Discovery”, Proceedings of the Eighth International Conference on Technology and Education, Toronto, Canada, pp. 874–875.  Online.
  • Awbrey, J.L., and Awbrey, S.M. (January 1991), “Exploring Research Data Interactively : Developing a Computer Architecture for Inquiry”, Poster presented at the Annual Sigma Xi Research Forum, University of Texas Medical Branch, Galveston, TX.
  • Awbrey, J.L., and Awbrey, S.M. (August 1990), “Exploring Research Data Interactively • Theme One : A Program of Inquiry”, Proceedings of the Sixth Annual Conference on Applications of Artificial Intelligence and CD-ROM in Education and Training, Society for Applied Learning Technology, Washington, DC, pp. 9–15.  Online.
Posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Survey of Semiotic Theory Of Information • 1

This is a Survey of previous blog and wiki posts on the Semiotic Theory Of Information.  All my projects are exploratory in essence but this line of inquiry is more open-ended than most.  The question is:

What is information and how does it impact the spectrum of activities that answer to the name of inquiry?

Setting out on what would become his lifelong quest to explore and explain the “Logic of Science”, C.S. Peirce pierced the veil of historical confusions obscuring the issue and fixed on what he called the “laws of information” as the key to solving the puzzle.  This was in 1865 and 1866, detailed in his lectures at Harvard University and the Lowell Institute.

Fast forward to the present and I see the Big Question as follows.  Having gone through the exercise of comparing and contrasting Peirce’s theory of information, however much it yet remains in a rough-hewn state, with Shannon’s paradigm so pervasively informing the ongoing revolution in our understanding and use of information, I have reason to believe Peirce’s idea is root and branch more general and has the potential, with due development, to resolve many mysteries still bedeviling our grasp of inference, information, and inquiry.

C.S. Peirce on the Laws of Information and the Logic of Science

Excursions

Blog Dialogs

Reference

Posted in Abduction, C.S. Peirce, Communication, Control, Cybernetics, Deduction, Determination, Discovery, Doubt, Epistemology, Fixation of Belief, Induction, Information, Information = Comprehension × Extension, Information Theory, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Interpretation, Invention, Knowledge, Learning Theory, Logic, Logic of Relatives, Logic of Science, Mathematics, Peirce, Philosophy, Philosophy of Science, Pragmatic Information, Probable Reasoning, Process Thinking, Relation Theory, Scientific Inquiry, Scientific Method, Semeiosis, Semiosis, Semiotic Information, Semiotics, Sign Relational Manifolds, Sign Relations, Surveys, Triadic Relations, Uncertainty | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Survey of Relation Theory • 1

In this Survey of blog and wiki posts on Relation Theory, relations are viewed from the perspective of combinatorics, in other words, as a topic in discrete mathematics, with special attention to finite structures and concrete set-theoretic constructions, many of which arise quite naturally in applications.  This approach to relation theory is distinct from, though closely related to, its study from the perspectives of abstract algebra on the one hand and formal logic on the other.

Elements

Relational Concepts

Relation Construction Relation Composition Relation Reduction
Relative Term Sign Relation Triadic Relation
Logic of Relatives Hypostatic Abstraction Continuous Predicate

Illustrations

Blog Series

Resources

Posted in Algebra, Algebra of Logic, C.S. Peirce, Category Theory, Combinatorics, Discrete Mathematics, Duality, Dyadic Relations, Foundations of Mathematics, Graph Theory, Logic, Logic of Relatives, Mathematics, Peirce, Relation Theory, Semiotics, Set Theory, Sign Relational Manifolds, Sign Relations, Surveys, Triadic Relations, Triadicity, Type Theory | Tagged , , , , , , , , , , , , , , , , , , , , , , | 1 Comment