Propositional Logic is a branch of formal logic that studies the logical relationships among propositions as indivisible units, using logical connectives to form compound propositions while abstracting away from internal structure.
1.9K
Publications
106.9K
Citations
2.1K
Authors
855
Institutions
Publications per year
2017–2026
135
Publications
1.9K
Results on the propositional μ-calculus
Dexter Kozen · Theoretical Computer Science · 1983 · 1.8K citations
Humanities, Mathematics, Logic +4
The complexity of satisfiability problems
Thomas J. Schaefer · 1978 · 1.8K citations · Full text
A new method for solving hard satisfiability problems
Bart Selman, Hector J. Levesque, David G. M. Mitchell · 1992 · 1.2K citations
1–5 of 1.9K
Authors
2.1K
- FW
13
h-index
- PM
13
h-index
- MZ
12
h-index
- TE
11
h-index
- MC
11
h-index
1–5 of 2.1K
Institutions
855
Centre National de la Recherche Scientifique
Paris, France
26 h-index
60 publications
2.1K citations
University of Toronto
Toronto, Canada
22 h-index
29 publications
4.2K citations
TU Wien
Vienna, Austria
20 h-index
33 publications
1.5K citations
University of Amsterdam
Amsterdam, The Netherlands
20 h-index
27 publications
1.4K citations
Stanford University
Stanford, United States
18 h-index
21 publications
1.9K citations
Sapienza University of Rome
Rome, Italy
17 h-index
24 publications
1.7K citations
Université Toulouse III - Paul Sabatier
Toulouse, France
17 h-index
30 publications
1.1K citations
Institut de Recherche en Informatique de Toulouse
Toulouse, France
17 h-index
29 publications
1.1K citations
1–8 of 855
Venues
- Journal of Symbolic Logic
115 publications · 9K citations
43
h-index
- Studia Logica
74 publications · 2.6K citations
30
h-index
- Artificial Intelligence
39 publications · 6.5K citations
29
h-index
- Journal of Logic and Computation
58 publications · 1.8K citations
25
h-index
- Notre Dame Journal of Formal Logic
63 publications · 1.9K citations
24
h-index
1–5