Quantification for Peirce's preferred system of triadic logic
| Autor: | Atwell R. Turquette |
|---|---|
| Rok vydání: | 1981 |
| Předmět: |
Absurdism
Mathematical logic Logic Mathematics::History and Overview Axiomatic system Basis (universal algebra) DUAL (cognitive architecture) Undecidable problem Epistemology TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES History and Philosophy of Science Computer Science::Logic in Computer Science Calculus Computational linguistics Dual pair Mathematics |
| Zdroj: | Studia Logica. 40:373-382 |
| ISSN: | 1572-8730 0039-3215 |
| Popis: | Without introducing quantifiers, minimal axiomatic systems have already been constructed for Peirce's triadic logics. The present paper constructs a dual pair of axiomatic systems which can be used to introduce quantifiers into Peirce's preferred system of triadic logic. It is assumed (on the basis of textual evidence) that Peirce would prefer a system which rejects the absurd but tolerates the absolutely undecidable. The systems which are introduced are shown to be absolutely consistent, deductively complete, and minimal. These dual axiomatic systems reveal an interesting elegance, independent of their historical motivation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink