Show simple item record

dc.contributor.authorShedenhelm, Richard Scott
dc.date.accessioned2014-03-03T20:22:03Z
dc.date.available2014-03-03T20:22:03Z
dc.date.issued2002-12
dc.identifier.othershedenhelm_richard_s_200212_ma
dc.identifier.urihttp://purl.galileo.usg.edu/uga_etd/shedenhelm_richard_s_200212_ma
dc.identifier.urihttp://hdl.handle.net/10724/20665
dc.description.abstractThis work represents a marriage of Peirce’s syntactic rules for performing inferences in the Alpha Existential Graphs with the recent technique of truth trees. The vitality of this marriage is brought to light by demonstrating the soundness of the Alpha system in a much more diagrammatic way than has ever before been accomplished. While the use of truth trees to work with properties such as soundness and completeness is not new in this work, the employment of a graphical form of the trees is novel, especially in the context of Peirce’s graphical logic. Finally, I suggest how the same method would apply to Peirce’s earlier system, the Entitative Graphs.
dc.languageeng
dc.publisheruga
dc.rightspublic
dc.subjectCharles Sanders Peirce
dc.subjectGraphical logic
dc.subjectExistential graphs
dc.subjectEntitative graphs
dc.subjectTruth trees
dc.subjectSoundness
dc.titleA soundness proof of C.S. Peirce's Alpha Existential Graphs using truth trees, with an appendix on the "Alpha" Entitative Graphs
dc.typeThesis
dc.description.degreeMA
dc.description.departmentPhilosophy
dc.description.majorPhilosophy
dc.description.advisorO. Bradley Bassler
dc.description.committeeO. Bradley Bassler
dc.description.committeeRobert G. Burton
dc.description.committeeCharles B. Cross


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record