Results 221 to 230 of about 27,151 (281)
Some of the next articles are maybe not open access.
1993
Abstract To describe the nature of propositions and propositional expressions. To describe what mathematical proof involves. To describe how rules of inference can be used in the proof process. To show how propositional calculus can be used during requirements analysis and system specification.
David Gries, Fred B. Schneider
openaire +2 more sources
Abstract To describe the nature of propositions and propositional expressions. To describe what mathematical proof involves. To describe how rules of inference can be used in the proof process. To show how propositional calculus can be used during requirements analysis and system specification.
David Gries, Fred B. Schneider
openaire +2 more sources
Basic Propositional Calculus I
Mathematical Logic Quarterly, 1998AbstractWe present an axiomatization for Basic Propositional Calculus BPC and give a completeness theorem for the class of transitive Kripke structures. We present several refinements, including a completeness theorem for irreflexive trees. The class of intermediate logics includes two maximal nodes, one being Classical Propositional Calculus CPC, the ...
Ardeshir, Mohammad, Ruitenburg, Wim
openaire +2 more sources
2000
Abstract Propositional calculus is the study of the propositional connectives; these are operators on statements or on formulas. First of all there is negation, which we denote by the symbol − which is placed in front of a formula.
René Cori, Daniel Lascar
openaire +1 more source
Abstract Propositional calculus is the study of the propositional connectives; these are operators on statements or on formulas. First of all there is negation, which we denote by the symbol − which is placed in front of a formula.
René Cori, Daniel Lascar
openaire +1 more source
Intuitionistic Propositional Calculus
1992Intuitionism is deemed to be the most important non-classical logic calculus. There is not much exaggeration in saying that it has arisen accidentally, as an attempt to axiomatize a certain three-valued logic. In fact, it should be rather regarded as the result of a programme of putting constraints on the laws and rules of classical logic.
Leonard Bolc, Piotr Borowik
openaire +1 more source
Space Complexity in Propositional Calculus
SIAM Journal on Computing, 2000Summary: We study space complexity in the framework of propositional proofs. We consider a natural model analogous to Turing machines with a read-only input tape and such popular propositional proof systems as resolution, polynomial calculus, and Frege systems.
Alekhnovich, Michael +3 more
openaire +1 more source
Intuitionistic Propositional Calculus
1995It seems that, over many centuries, no philosopher or mathematician ever seriously questioned Aristotle’s law of the excluded third: for every proposition p, either p or not p, symbolically p V ¬p. In retrospect, it appears that Aristotle himself had some doubts about applying this law when talking about events in time, e.g., when p was the proposition:
W. S. Anglin, J. Lambek
openaire +1 more source
1987
AbstractThis is the first of three chapters on general mathematics as applied to economics, and presents a treatment of the calculus of propositions. The seven sections of the chapter are: the Boolean laws; normal forms; the conditional; tautologies; existential and universal quantifiers; predicates and sets; and Shao Yung's Program.
openaire +1 more source
AbstractThis is the first of three chapters on general mathematics as applied to economics, and presents a treatment of the calculus of propositions. The seven sections of the chapter are: the Boolean laws; normal forms; the conditional; tautologies; existential and universal quantifiers; predicates and sets; and Shao Yung's Program.
openaire +1 more source