*Javascript*to function properly

# Bibliography

"Betagraphic": An Alternative Formulation of Predicate Calculus

## Tabs

Type:

Article in Journal

Title:

"Betagraphic": An Alternative Formulation of Predicate Calculus

Year:

2015

Journal:

Transactions of the Charles S. Peirce Society

Volume:

51

Issue:

2

Pages:

137-172

Abstract:

We offer a formulation of first-order logic that is diagrammatic in nature, retains a basic part of C. S. Peirce's own graphics, renders quantification both graphical and easily readable, and seems a natural approach to what lies at or near the foundations of his science of Semeiotic. The approach is in agreement with Peirce's propositional graphics (Alpha EG), but different in its treatment of quantifiers. Our syntax is formulated with the "atoms" of the usual predicate calculus given a fine structure in terms of a bonding operation on monadic, dyadic, and triadic building blocks. A suitable semantics is introduced, based on relative product and culminating with a proof of a precise formulation of the famous Peircean Non-Reduction Thesis (NRT). (In particular, in Theorem B', we document precisely the quantificational aspect of NRT: quantification is a multivalent operation, with full expressivity occurring only for valencies ≥ 3.)The principles NRT and RCT (Relational Completeness Thesis) are implicit in predicate logic, whatever form it might take; but their explicit presentation has generally been either neglected (classical predicate calculus) or attended by technical complexities (Peirce's Beta EG, Burch's PAL). Here, the proofs are both explicit and relatively simple. Other contexts in which our "molecular" treatment of relations may be advantageous will be indicated.

Keywords:

ISSN:

0009-1774

Language:

English

*et al*(2015). "Betagraphic": An Alternative Formulation of Predicate Calculus.

*Transactions of the Charles S. Peirce Society*,

*51*(2), 137-172.

The entry in BibTeX format.

author = "Thomas McLaughlin and Elise Bisanz and Scott R. Cunningham and Clyde Hendrick and Levi Johnson and Kenneth L. Ketner and Michael O'Boyle",

title = "{"Betagraphic": An Alternative Formulation of Predicate Calculus}",

year = 2015,

journal = "Transactions of the Charles S. Peirce Society",

volume = 51,

number = "2",

pages = "137-172",

issn = "0009-1774",

abstract = "{We offer a formulation of first-order logic that is diagrammatic in nature, retains a basic part of C. S. Peirce's own graphics, renders quantification both graphical and easily readable, and seems a natural approach to what lies at or near the foundations of his science of Semeiotic. The approach is in agreement with Peirce's propositional graphics (Alpha EG), but different in its treatment of quantifiers. Our syntax is formulated with the "atoms" of the usual predicate calculus given a fine structure in terms of a bonding operation on monadic, dyadic, and triadic building blocks. A suitable semantics is introduced, based on relative product and culminating with a proof of a precise formulation of the famous Peircean Non-Reduction Thesis (NRT). (In particular, in Theorem B', we document precisely the quantificational aspect of NRT: quantification is a multivalent operation, with full expressivity occurring only for valencies ≥ 3.)The principles NRT and RCT (Relational Completeness Thesis) are implicit in predicate logic, whatever form it might take; but their explicit presentation has generally been either neglected (classical predicate calculus) or attended by technical complexities (Peirce's Beta EG, Burch's PAL). Here, the proofs are both explicit and relatively simple. Other contexts in which our "molecular" treatment of relations may be advantageous will be indicated.}",

keywords = "Diagrammatic Notation, Graph, Non-reduction Theorem, Quantifier Valency, Relational Bonding",

language = "English",

note = "From the Commens Bibliography | \url{http://www.commens.org/bibliography/journal_article/mclaughlin-thomas-bisanz-elise-cunningham-scott-r-hendrick-clyde}"

}

title = "{"Betagraphic": An Alternative Formulation of Predicate Calculus}",

year = 2015,

journal = "Transactions of the Charles S. Peirce Society",

volume = 51,

number = "2",

pages = "137-172",

issn = "0009-1774",

abstract = "{We offer a formulation of first-order logic that is diagrammatic in nature, retains a basic part of C. S. Peirce's own graphics, renders quantification both graphical and easily readable, and seems a natural approach to what lies at or near the foundations of his science of Semeiotic. The approach is in agreement with Peirce's propositional graphics (Alpha EG), but different in its treatment of quantifiers. Our syntax is formulated with the "atoms" of the usual predicate calculus given a fine structure in terms of a bonding operation on monadic, dyadic, and triadic building blocks. A suitable semantics is introduced, based on relative product and culminating with a proof of a precise formulation of the famous Peircean Non-Reduction Thesis (NRT). (In particular, in Theorem B', we document precisely the quantificational aspect of NRT: quantification is a multivalent operation, with full expressivity occurring only for valencies ≥ 3.)The principles NRT and RCT (Relational Completeness Thesis) are implicit in predicate logic, whatever form it might take; but their explicit presentation has generally been either neglected (classical predicate calculus) or attended by technical complexities (Peirce's Beta EG, Burch's PAL). Here, the proofs are both explicit and relatively simple. Other contexts in which our "molecular" treatment of relations may be advantageous will be indicated.}",

keywords = "Diagrammatic Notation, Graph, Non-reduction Theorem, Quantifier Valency, Relational Bonding",

language = "English",

note = "From the Commens Bibliography | \url{http://www.commens.org/bibliography/journal_article/mclaughlin-thomas-bisanz-elise-cunningham-scott-r-hendrick-clyde}"

}