An entitative graph is an element of the diagrammatic syntax for logic that Charles Sanders Peirce developed under the name of qualitative logic beginning in the 1880s, taking the coverage of the formalism only as far as the propositional or sentential aspects of logic are concerned. See 3.468, 4.434, and 4.564 in Peirce's Collected Papers. Peirce wrote of this system in an 1897 Monist article titled "The Logic of Relatives", although he had mentioned logical graphs in an 1882 letter to . The syntax is: The semantics are: Entitative graphs are read from outside to inside.
| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:label
| - Entitative graph (en)
- 实体图 (zh)
|
| rdfs:comment
| - 实体图是查尔斯·皮尔士于1880年代开始在定性逻辑的名义下开发的逻辑的图形语法的一个要素，只覆盖了逻辑的命题演算方面所关心的内容的形式化。请参见《Peirce's Collected Papers》的 3.468, 4.434, 和 4.564。 语法是:
* 空白页；
* 单一的字母，短语；
* 包围在叫做切的简单闭合曲线内的对象(子图)。切可以为空。 语义是:
* 空白页指示假；
* 字母，短语，子图和整个图可以为真或假；
* 用切包围对象等价于布尔补运算。因此空切指示真理；
* 在一个给定切内的所有对象都默认的用析取连结起来了。 "证明"使用规则的简短列表操纵一个图，直到这个图被简约到一个空切或空白页。可以如此简约的图现在叫做重言式或矛盾。不能简化超过一个特定点的图类似于一阶逻辑的的公式。 皮尔士不久就放弃了实体图而转向存在图，它的句子(alpha)部分是实体图的对偶。他开发了存在图使其成为一阶逻辑和正规模态逻辑的另一个形式化。 的同构于实体图。 (zh)
- An entitative graph is an element of the diagrammatic syntax for logic that Charles Sanders Peirce developed under the name of qualitative logic beginning in the 1880s, taking the coverage of the formalism only as far as the propositional or sentential aspects of logic are concerned. See 3.468, 4.434, and 4.564 in Peirce's Collected Papers. Peirce wrote of this system in an 1897 Monist article titled "The Logic of Relatives", although he had mentioned logical graphs in an 1882 letter to . The syntax is: The semantics are: Entitative graphs are read from outside to inside. (en)
|
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| Link from a Wikipage to an external page
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| date
| |
| reason
| - the syntax and semantics seem arbitrary/unmotivated and not fully explained (en)
|
| has abstract
| - An entitative graph is an element of the diagrammatic syntax for logic that Charles Sanders Peirce developed under the name of qualitative logic beginning in the 1880s, taking the coverage of the formalism only as far as the propositional or sentential aspects of logic are concerned. See 3.468, 4.434, and 4.564 in Peirce's Collected Papers. Peirce wrote of this system in an 1897 Monist article titled "The Logic of Relatives", although he had mentioned logical graphs in an 1882 letter to . The syntax is:
* The blank page;
* Single letters, phrases;
* Dashes;
* Objects (subgraphs) enclosed by a simple closed curve called a cut. A cut can be empty. The semantics are:
* The blank page denotes False;
* Letters, phrases, subgraphs, and entire graphs can be True or False;
* To surround objects with a cut is equivalent to Boolean complementation. Hence an empty cut denotes Truth;
* All objects within a given cut are tacitly joined by disjunction.
* A dash is read "everything" if it is encircled an even number of times, and read "something" if it is encircled an odd number of times. Entitative graphs are read from outside to inside. A "proof" manipulates a graph, using a short list of rules, until the graph is reduced to an empty cut or the blank page. A graph that can be so reduced is what is now called a tautology (or the complement thereof). Graphs that cannot be simplified beyond a certain point are analogues of the satisfiable formulas of first-order logic. Peirce soon abandoned the entitative graphs for the existential graphs, whose sentential (alpha) part is dual to the entitative graphs. He developed the existential graphs until they became another formalism for what are now termed first-order logic and normal modal logic. The primary algebra of G. Spencer-Brown's Laws of Form is isomorphic to the entitative graphs. (en)
- 实体图是查尔斯·皮尔士于1880年代开始在定性逻辑的名义下开发的逻辑的图形语法的一个要素，只覆盖了逻辑的命题演算方面所关心的内容的形式化。请参见《Peirce's Collected Papers》的 3.468, 4.434, 和 4.564。 语法是:
* 空白页；
* 单一的字母，短语；
* 包围在叫做切的简单闭合曲线内的对象(子图)。切可以为空。 语义是:
* 空白页指示假；
* 字母，短语，子图和整个图可以为真或假；
* 用切包围对象等价于布尔补运算。因此空切指示真理；
* 在一个给定切内的所有对象都默认的用析取连结起来了。 "证明"使用规则的简短列表操纵一个图，直到这个图被简约到一个空切或空白页。可以如此简约的图现在叫做重言式或矛盾。不能简化超过一个特定点的图类似于一阶逻辑的的公式。 皮尔士不久就放弃了实体图而转向存在图，它的句子(alpha)部分是实体图的对偶。他开发了存在图使其成为一阶逻辑和正规模态逻辑的另一个形式化。 的同构于实体图。 (zh)
|
| gold:hypernym
| |
| prov:wasDerivedFrom
| |
| page length (characters) of wiki page
| |
| foaf:isPrimaryTopicOf
| |
| is Link from a Wikipage to another Wikipage
of | |
| is Wikipage redirect
of | |
| is foaf:primaryTopic
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)