Jon Awbrey<p><a href="https://mathstodon.xyz/tags/LogicalGraphs" class="mention hashtag" rel="tag">#<span>LogicalGraphs</span></a> • 1<br />• <a href="https://oeis.org/w/index.php?title=Logical_Graphs&stable=0&redirect=no" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">oeis.org/w/index.php?title=Log</span><span class="invisible">ical_Graphs&stable=0&redirect=no</span></a></p><p>A <a href="https://mathstodon.xyz/tags/LogicalGraph" class="mention hashtag" rel="tag">#<span>LogicalGraph</span></a> is a graph-theoretic structure in one of the systems of graphical syntax Charles Sanders <a href="https://mathstodon.xyz/tags/Peirce" class="mention hashtag" rel="tag">#<span>Peirce</span></a> developed for <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="tag">#<span>Logic</span></a>.</p><p>In his papers on <a href="https://mathstodon.xyz/tags/QualitativeLogic" class="mention hashtag" rel="tag">#<span>QualitativeLogic</span></a>, <a href="https://mathstodon.xyz/tags/EntitativeGraphs" class="mention hashtag" rel="tag">#<span>EntitativeGraphs</span></a>, and <a href="https://mathstodon.xyz/tags/ExistentialGraphs" class="mention hashtag" rel="tag">#<span>ExistentialGraphs</span></a>, Peirce developed several versions of a graphical formalism, or a graph-theoretic formal language, designed to be interpreted for logic.</p><p><a href="https://mathstodon.xyz/tags/PropositionalCalculus" class="mention hashtag" rel="tag">#<span>PropositionalCalculus</span></a> <a href="https://mathstodon.xyz/tags/BooleanFunctions" class="mention hashtag" rel="tag">#<span>BooleanFunctions</span></a><br /><a href="https://mathstodon.xyz/tags/GraphTheory" class="mention hashtag" rel="tag">#<span>GraphTheory</span></a> <a href="https://mathstodon.xyz/tags/ModelTheory" class="mention hashtag" rel="tag">#<span>ModelTheory</span></a> <a href="https://mathstodon.xyz/tags/ProofTheory" class="mention hashtag" rel="tag">#<span>ProofTheory</span></a></p>