Skip to search formSkip to main contentSkip to account menu

Propositional calculus

Known as: Sentence logic, Exportation in logic, Truth-functional propositional logic 
Propositional calculus (also called propositional logic, sentential calculus, sentential logic, or sometimes zeroth-order logic) is the branch of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
A New Kind of ScienceAmpersandAttributional calculusCalculus ratiocinator

Broader (1)

Boolean algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
Generality of proofs and its Brauerian representation
Abstract The generality of a derivation is an equivalence relation on the set of occurrences of variables in its premises and… 
2001
2001
Leibniz filters and the strong version of a protoalgebraic logic
Abstract. A filter of a sentential logic ? is Leibniz when it is the smallest one among all the ?-filters on the same algebra… 
1995
1995
A geometric proof of the completeness of the Łukasiewicz calculus
Abstract We give a self-contained geometric proof of the completeness theorem for the infinite-valued sentential calculus of… 
1993
1993
Redressing the balance: the advantages of informal evaluation techniques for Intelligent Learning Environments
The paper discusses issues to be considered when evaluating an Intelligent Learning Environment. In particular it considers… 
Highly Cited
1988
Highly Cited
1988
Fuzzy resolution principle
The resolution principle based on reduction and absurdum is extended from binary logic to fuzzy logic. The extension is dependent… 
Review
1986
Review
1986
Many-valued Logic
Many-valued logic is a vast field with hundreds of published papers and over ten monographs devoted to it. I have attempted to… 
Highly Cited
1983
Highly Cited
1983
Scientists' Understanding of Propositional Logic: An Experimental Investigation
Seventy-two scientists (psychologists, biologists, and physicists) from a large US midwestern state university completed a… 
1978
1978
A formal system for the non-theorems of the propositional calculus
Introduction The completeness of the classical propositional calculus allows us to give a deductive system consisting of finitely… 
Review
1966
Review
1966
Review: Saul A. Kripke, Semantical Analysis of Modal Logic I. Normal Modal Propositional Calculi
1949
1949
Fragments of the propositional calculus
Of the several methods for proving the completeness of sets of axioms for the prepositional calculus perhaps the simplest is due… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)