mastodon.xyz is one of the many independent Mastodon servers you can use to participate in the fediverse.
A Mastodon instance, open to everyone, but mainly English and French speaking.

Administered by:

Server stats:

746
active users

#LogicalGraphs

0 posts0 participants0 posts today

Charles Sanders Peirce, George Spencer Brown, and Me • 4
inquiryintoinquiry.com/2017/08
bsky.app/profile/inquiryintoin

Two things impacting my studies of Peirce and Spencer Brown over the years were my parallel studies in mathematics and computer science. In the overlap between those areas came courses in logic, mathematical linguistics, and the theory of formal languages, grammars, and automata.

My intellectual wanderings over a nine‑year undergraduate career would take me through a cycle of majors from math and physics, to communication, psychology, philosophy, and a cross‑cultural liberal arts program, then back to grad school in mathematics.

The puzzles Peirce and Spencer Brown beset my brain with were a big part of what drove me back to math, since I could see I had no chance of resolving them without learning a lot more algebra, logic, and topology than I had learned till then.

Inquiry Into Inquiry · Charles Sanders Peirce, George Spencer Brown, and Me • 4Two things impacting my studies of Peirce and Spencer Brown over the years were my parallel studies in mathematics and computer science.  In the overlap between those areas came courses in log…

Peirce's Law • 1
inquiryintoinquiry.com/2023/10

A Curious Truth of Classical Logic —

Peirce's law is a propositional calculus formula which states a non‑obvious truth of classical logic and affords a novel way of defining classical propositional calculus.

Introduction —

Peirce's law is commonly expressed in the following form.

• ((p ⇒ q) ⇒ p) ⇒ p

Peirce's law holds in classical propositional calculus, but not in intuitionistic propositional calculus. The precise axiom system one chooses for classical propositional calculus determines whether Peirce's law is taken as an axiom or proven as a theorem.

History —

Here is Peirce's own statement and proof of the law:

❝A “fifth icon” is required for the principle of excluded middle and other propositions connected with it. One of the simplest formulae of this kind is:

• {(x ‒< y) ‒< x} ‒< x.

❝This is hardly axiomatical. That it is true appears as follows. It can only be false by the final consequent x being false while its antecedent (x ‒< y) ‒< x is true. If this is true, either its consequent, x, is true, when the whole formula would be true, or its antecedent x ‒< y is false. But in the last case the antecedent of x ‒< y, that is x, must be true.❞ (Peirce, CP 3.384).

Peirce goes on to point out an immediate application of the law:

❝From the formula just given, we at once get:

• {(x ‒< y) ‒< α} ‒< x,

❝where the α is used in such a sense that (x ‒< y) ‒< α means that from (x ‒< y) every proposition follows. With that understanding, the formula states the principle of excluded middle, that from the falsity of the denial of x follows the truth of x.❞ (Peirce, CP 3.384).

Inquiry Into Inquiry · Peirce’s Law • 1A Curious Truth of Classical Logic Peirce’s law is a propositional calculus formula which states a non‑obvious truth of classical logic and affords a novel way of defining classical pro…

Logical Graphs • First Impressions 1
inquiryintoinquiry.com/2023/08

Introduction • Moving Pictures of Thought —

A “logical graph” is a graph-theoretic structure in one of the systems of graphical syntax Charles Sanders Peirce developed for logic.

In numerous papers on “qualitative logic”, “entitative graphs”, and “existential graphs”, Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.

In the century since Peirce initiated this line of development, a variety of formal systems have branched out from what is abstractly the same formal base of graph-theoretic structures. This article examines the common basis of these formal systems from a bird's eye view, focusing on the aspects of form shared by the entire family of algebras, calculi, or languages, however they happen to be viewed in a given application.

#Peirce #Logic #LogicalGraphs #EntitativeGraphs #ExistensialGraphs
#SpencerBrown #LawsOfForm #BooleanFunctions #PropositionalCalculus

Inquiry Into InquiryLogical Graphs • First ImpressionsA logical graph is a graph-theoretic structure in one of the styles of graphical syntax that Charles Sanders Peirce developed for logic.

Differential Logic
inquiryintoinquiry.com/2023/08

Differential logic is the logic of variation — the logic of change and difference.

Differential logic is the component of logic whose object is the description of variation, for example, the aspects of change, difference, distribution, and diversity, in universes of discourse subject to qualitative logical description. In its formalization, differential logic treats the principles governing the use of a “differential logical calculus”, in other words, a formal system with the expressive capacity to describe change and diversity in logical universes of discourse.

A simple case of a differential logical calculus is furnished by a differential propositional calculus. This augments ordinary propositional calculus in the same way the differential calculus of Leibniz and Newton augments the analytic geometry of Descartes.

Resources —

Differential Logic
oeis.org/wiki/Differential_Log
• Part 1 ( oeis.org/wiki/Differential_Log )
• Part 2 ( oeis.org/wiki/Differential_Log )
• Part 3 ( oeis.org/wiki/Differential_Log )

Differential Propositional Calculus
oeis.org/wiki/Differential_Pro
• Part 1 ( oeis.org/wiki/Differential_Pro )
• Part 2 ( oeis.org/wiki/Differential_Pro )

Differential Logic and Dynamic Systems
oeis.org/wiki/Differential_Log
• Part 1 ( oeis.org/wiki/Differential_Log )
• Part 2 ( oeis.org/wiki/Differential_Log )
• Part 3 ( oeis.org/wiki/Differential_Log )
• Part 4 ( oeis.org/wiki/Differential_Log )
• Part 5 ( oeis.org/wiki/Differential_Log )

#Peirce #Logic #LogicalGraphs #DifferentialLogic #DiscreteDynamicalSystems
#Leibniz #BooleanFunctions #BooleanDifferenceCalculus #QualitativeDynamics
#DifferentialPropositions #MinimalNegationOperators #NeuralNetworkSystems

Inquiry Into InquiryDifferential LogicThe Logic of Change and Difference Differential logic is the logic of variation — the logic of change and difference. Differential logic is the component of logic whose object is the descript…
Continued thread

Systems of Interpretation • 2
inquiryintoinquiry.com/2023/05

Let's start as simply as possible. The following Figure is typical of many I have used to illustrate sign relations from the time I first began studying Peirce's theory of signs.

Figure 2. An Elementary Sign Relation
inquiryintoinquiry.files.wordp

The above variant comes from a paper Susan Awbrey and I presented at a conference in 1999, a revised version of which was published in 2001.

As the drafter of that drawing I can speak with authority about the artist's intentions in drawing it and also about the conventions of interpretation forming the matrix of its conception and delivery.

Here is how we set it up —

❝Figure 2 represents an “elementary sign relation”. It is a single transaction taking place among 3 entities, the object o, the sign s, and the interpretant sign i, the association of which is typically represented by means of the ordered triple (o, s, i).❞

One of the interpretive conventions implied in that setup is hallowed by long tradition, going back to the earliest styles of presentation in mathematics. In it one draws a figure intended as “representative” of many figures. Regarded as a concrete drawing the figure is naturally imperfect, individual, peculiar, and special but it's meant to be taken purely as a representative of its class — generic, ideal, and typical. That is the main convention of interpretation which goes into giving diagrams and figures their significant power.

References —

Conceptual Barriers to Creating Integrative Universities
academia.edu/1266492/Conceptua

Organizations of Learning or Learning Organizations
arisbe.sitehost.iu.edu/menu/li

Systems of Interpretation • 1
inquiryintoinquiry.com/2023/05

Questions have arisen about the different styles of diagrams and figures used to represent triadic sign relations in Peircean semiotics. What do they mean? Which style is best? Among the most popular pictures some use geometric triangles while others use the three‑pronged graphs Peirce used in his logical graphs to represent triadic relations.

Diagrams and figures, like any signs, can serve to communicate the intended interpretants and thus to coordinate the conduct of interpreters toward the intended objects — but only in communities of interpretation where the conventions of interpretation are understood. Conventions of interpretation are by comparison far more difficult to communicate.

That brings us to the first question we have to ask about the possibility of communication in this area, namely, what conventions of interpretation are needed to make sense of these diagrams, figures, and graphs?

#Peirce #Logic #LogicalGraphs #RelationTheory #Semiotics #Semiosis
#DiagrammaticReasoning #InterpretiveFrameworks #ObjectiveFrameworks
#SystemsOfInterpretation #SignRelations #TriadicRelations #Visualization

Inquiry Into Inquiry · Systems of Interpretation • 1Re: Peirce List • Mike Bergman • Valentine Daniel Questions have arisen about the different styles of diagrams and figures used to represent triadic sign relations in Peircean semiotics.&…
Continued thread

Differential Logic and Dynamic Systems • Review and Transition 1
oeis.org/wiki/Differential_Log

This note continues a previous discussion on the problem of dealing with change and diversity in logic-based intelligent systems. It is useful to begin by summarizing essential material from previous reports.

Table 1 outlines a notation for propositional calculus based on two types of logical connectives, both of variable \(k\)-ary scope.

• A bracketed list of propositional expressions in the form \(\texttt{(} e_1 \texttt{,} e_2 \texttt{,} \ldots \texttt{,} e_{k-1} \texttt{,} e_k \texttt{)}\) indicates that exactly one of the propositions \(e_1, e_2, \ldots, e_{k-1}, e_k\) is false.

• A concatenation of propositional expressions in the form \(e_1 ~ e_2 ~ \ldots ~ e_{k-1} ~ e_k\) indicates that all of the propositions \(e_1, e_2, \ldots, e_{k-1}, e_k\) are true, in other words, that their logical conjunction is true.

All other propositional connectives can be obtained in a very efficient style of representation through combinations of these two forms. Strictly speaking, the concatenation form is dispensable in light of the bracketed form but it is convenient to maintain it as an abbreviation of more complicated bracket expressions.

#Peirce #Logic #LogicalGraphs #DifferentialLogic #DynamicSystems
#BooleanFunctions #BooleanDifferenceCalculus #QualitativeChange
#MinimalNegationOperators #NeuralNetworkSystems #Semiotics

Differential Logic and Dynamic Systems • Overview
oeis.org/wiki/Differential_Log

❝Stand and unfold yourself.❞
— Hamlet • Francisco • 1.1.2

This article develops a differential extension of propositional calculus and applies it to the analysis of dynamic systems whose states are described in qualitative logical terms.

The work pursued here is coordinated with a parallel application focusing on neural network systems but the dependencies are arranged to make the present article the main and the more self-contained work, to serve as a conceptual frame and a technical background for the network project.

#Peirce #Logic #LogicalGraphs #DifferentialLogic #DynamicSystems
#BooleanFunctions #BooleanDifferenceCalculus #QualitativeChange
#MinimalNegationOperators #NeuralNetworkSystems #Semiotics

oeis.orgDifferential Logic and Dynamic Systems • Overview - OeisWiki
Replied in thread

@bblfish @emondb @hochstenbach @josd @w3c

ICYMI —
lists.w3.org/Archives/Public/p

“Putting logic on the web changes logic itself”
— Pat Hayes

That could almost be the motto for all the work I've been doing on logical graphs for the last 50+ years.

Everything changed when I started putting what little I was incrementally learning about programming to work on what little I was gradually learning about logic and then everything took off when I ran into #Peirce's work on #LogicalGraphs.

lists.w3.orgAnimated Logic Graphs from Jon Awbrey on 2023-02-17 (public-rdfsurfaces@w3.org from February 2023)
Replied in thread

@bblfish @emondb @hochstenbach @josd @w3c

I'm starting to lose track of all the different discussions in various venues. I'll put a #RDFSurfaces tag on this in hopes of being able to find it again.

I do remember discussing #Peirce and #LogicalGraphs and #CategoryTheory and #DigrammaticReasoning et cetera with Henry in one of the Zulip chatrooms a year, or maybe two ago ...

I'll repost some of what I wrote on the W³C list for anyone who may have missed it.

Continued thread

Peirce’s 1870 “Logic of Relatives” • Overview
inquiryintoinquiry.com/2019/09

Over the years I copied out various drafts of my study notes to the web, consisting of selections from Peirce’s paper along with my running commentary. A few years back I serialized what progress I had made so far to this blog and this Overview consists of links to those installments.

#Peirce #Logic #LogicOfRelatives #RelationTheory #LOR1870
#Boole #LogicalCalculus #MathematicalLogic #LogicalGraphs

Inquiry Into InquiryPeirce’s 1870 “Logic of Relatives” •&nbsp;OverviewBy Jon Awbrey

Peirce’s 1870 “Logic of Relatives” • Overview
inquiryintoinquiry.com/2019/09

My long ago encounter with Peirce’s 1870 paper, “Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole’s Calculus of Logic”, was one of the events precipitating my return from the hazier heights of philosophy to the solid plains of mathematics below.

#Peirce #Logic #LogicOfRelatives #RelationTheory #LOR1870
#Boole #LogicalCalculus #MathematicalLogic #LogicalGraphs

Inquiry Into InquiryPeirce’s 1870 “Logic of Relatives” •&nbsp;OverviewBy Jon Awbrey
Replied in thread
Replied in thread

@hochstenbach @josd

A program I worked on all through the 80s implemented a propositional modeler based on #Peirce's #LogicalGraphs, improving the efficiency of the Alpha level through the use of #MinimalNegationOperators. There's a collection of articles, blog posts, and group discussions about that linked on the following page.

#ThemeOneProgram#SurveyPage
inquiryintoinquiry.com/2022/06

Inquiry Into InquirySurvey of Theme One Program •&nbsp;4By Jon Awbrey
Replied in thread

@bblfish @josd @semwebpro @hochstenbach

One thing I found out early on is how critical it is to get #AlphaGraphs (#BooleanFunctions, #PropositionalCalculus, #ZerothOrderLogic) down tight. If you do that it changes how you view #FOL (#PredicateCalculus, #QuantificationalLogic). That tends to rub people who view FOL as #GOL (#GodsOwnLogic) the wrong way so you have watch out for that if you go down this road.

Here's a primer on \(\alpha\) #LogicalGraphs as I see them —
oeis.org/w/index.php?title=Log

oeis.orgLogical Graphs - OeisWiki