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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1937-2018
05010015019372017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
Interpretation of Proofs: Classical Propositional Calculus 
Is this relevant?
2002
2002
We develop a formal system for the class of all implications A and conjunctions K , on partially ordered sets (L;6) with top… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
1994
1994
Many propositional calculus problems — for example the Ramsey or the pigeon-hole problems — can quite naturally be represented by… (More)
  • figure 1
  • figure 3
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper is a slightly revised version of a paper that appeared in the 4th Int. Conf. on Knowledge Representation and Reasoning… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The propositional mu-calculus is a propositional logic of programs which incorporates a least fixpoint operator and subsumes the… (More)
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Abatraet. It is the purpose of this note to show that the question of whether a given propositional formula is intuitionistically… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
The motivation for this work comes from two general sources. The first source is the basic open question in complexity theory of… (More)
Is this relevant?
Highly Cited
1974
Highly Cited
1974
One of the most important open questions in the field of computational complexity is the question of whether there is a… (More)
Is this relevant?