Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-10T10:59:55.138Z Has data issue: false hasContentIssue false
  • English
  • Français

A simple treatment of truth functions

Published online by Cambridge University Press:  12 March 2014

Alan Ross Anderson  and
Nuel D. Belnap Jr.
Alan Ross Anderson
Affiliation:
Yale University
Nuel D. Belnap Jr.
Affiliation:
Yale University
Get access Rights & Permissions [Opens in a new window]

Extract

In this note we present an axiomatization of the classical two-valued propositional calculus, for which proofs of decidability, consistency, completeness, and independence, are almost trivial (given an understanding of truth tables).

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 24 , Issue 4 , December 1959 , pp. 301 - 302
Copyright
Copyright © Association for Symbolic Logic 1952

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Ackermann, Wilhelm, Begründung einer strengen Implikation, this Journal, vol. 21 (1956), pp. 113–128.Google Scholar
[2]Anderson, Alan Ross and Belnap, Nuel D. Jr., A modification of Ackermann's ‘rigorous implication’, (abstract), this Journal, vol. 23 (1958), pp. 457–458.Google Scholar
[3]Church, Alonzo, Introduction to mathematical logic, vol. 1, Princeton, 1956.Google Scholar
[4]Curry, Haskell B., The permutability of rules in the classical inferential calculus, this Journal, vol. 17 (1952), pp. 245–248.Google Scholar
[5]Curry, Haskell B. and Feys, Robert, Combinatory logic, Amsterdam, 1958.Google Scholar
[6]Parry, W. T., Ein Axiomensystem fur eine neue Art von Implikation (analytische Implikation), Ergebnisse eines mathematischen Kolloquiums, vol. 4 (1933), pp. 5–6.Google Scholar