VALENTAL ASPECTS OF PEIRCEAN ALGEBRAIC LOGIC Academic Article

abstract

• This paper describes a system of logic that has both an algebraic syntax and a graphical syntax and that may be regarded as a kind of semantic net. The paper analyses certain "valental" characteristics of terms and graphs of this logical system: characteristics defined in terms of the "valence", or number of argument-places, in the terms and graphs. The most famous valental result is the so-called "Reduction Thesis" of Charles Sanders Peirce. The paper briefly explicates the author's proof, which is to be published in a forthcoming book, of this Reduction Thesis. Several additional valental results are proved, and the potential of PAL as a bridge between logic and topological graph theory is suggested. 1992.

authors

• Burch, Robert

published proceedings

• COMPUTERS & MATHEMATICS WITH APPLICATIONS

author list (cited authors)

• BURCH, R. W.

citation count

• 7

complete list of authors

• BURCH, RW

publication date

• January 1992

publisher

• Elsevier  Publisher

published in

• Computers and Mathematics with Applications  Journal

Digital Object Identifier (DOI)

• 10.1016/0898-1221(92)90128-5

start page

• 665

end page

• 677

volume

• 23

issue

• 6-9

URL

• http://dx.doi.org/10.1016/0898-1221(92)90128-5