Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
proof systems
Description:
Formal systems of rules for deriving valid proofs in logic, mathematics, and computer science.
Primary topic:
Logic, programming, and type systems (34%)
Related topics:
Logic, programming, and type systems (34%),
Logic, Reasoning, and Knowledge (19%),
Complexity and Algorithms in Graphs (9%),
Advanced Algebra and Logic (7%)
Wikidata ID:
wiki/Q7250002
OpenAlex ID:
keywords/proof-systems
Natural Deduction: A Proof-Theoretical Study
1965
·
Dag Prawitz
·
1,654
On the Complexity of Derivation in Propositional Calculus
1970
·
G. S. Tseitin
·
Springer eBooks
·
654
Ten Years of Hoare's Logic: A Survey—Part I
1981
·
Krzysztof R. Apt
·
ACM Transactions on Programming Languages and Systems
·
589
PDF
Clique is hard to approximate within n/sup 1-ε/
2002
·
J. Hastad
·
Annual Symposium on Foundations of Computer Science
·
538
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
1998
·
Mihir Bellare
, Oded Goldreich
, et al.
·
SIAM Journal on Computing
·
530
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
1997
·
Jan Krajíček
·
Journal of Symbolic Logic
·
364
Towards Understanding and Harnessing the Potential of Clause Learning
2004
·
P. Beame
, H. Kautz
, et al.
·
Journal of Artificial Intelligence Research
·
346
PDF
Every Prime Has a Succinct Certificate
1975
·
Vaughan R. Pratt
·
SIAM Journal on Computing
·
345
On the complexity of cutting-plane proofs
1987
·
W. Cook
, C.R. Coullard
, et al.
·
Discrete Applied Mathematics
·
341
Petri net models for algebraic theories of concurrency: extended abstract
1987
·
Rob van Glabbeek
, Frits Vaandrager
·
Lecture notes in computer science
·
292
Reasoning with logical bilattices
1996
·
Ofer Arieli
, Arnon Avron
·
Journal of Logic Language and Information
·
289
Verification of Sequential and Concurrent Programs
2009
·
Krzysztof R. Apt
, Frank S. de Boer
, et al.
·
Texts in computer science
·
271
PDF
The Complexity of Propositional Proofs
1995
·
Alasdair Urquhart
·
Bulletin of Symbolic Logic
·
260
Practical verified computation with streaming interactive proofs
2012
·
Graham Cormode
, Michael Mitzenmacher
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
255
Logical Foundations of Proof Complexity
2010
·
Stephen Cook
, Phuong Nguyen
·
Cambridge University Press eBooks
·
249
Knowledge Compilation: Mechanisms for the Automatization of Cognitive Skills.
1980
·
David M. Neves
, John R. Anderson
·
249
Infinite objects in type theory
1994
·
Thierry Coquand
·
Lecture notes in computer science
·
238
Completing the temporal picture
1991
·
Zohar Manna
, Amir Pnueli
·
Theoretical Computer Science
·
238
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
1975
·
Stephen A. Cook
·
ACM Symposium on Theory of Computing (STOC)
·
238
Nearly-linear size holographic proofs
1994
·
Alexander Polishchuk
, Daniel A. Spielman
·
ACM Symposium on Theory of Computing (STOC)
·
236
Conservatively Extending Classical Logic With Transparent Truth
2012
·
DAVID RIPLEY
·
The Review of Symbolic Logic
·
219
PDF
Polynomial size proofs of the propositional pigeonhole principle
1987
·
Samuel R. Buss
·
Journal of Symbolic Logic
·
219
Distributed Provers with Applications to Undeniable Signatures
2007
·
Torben Pryds Pedersen
·
Springer eBooks
·
216
An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
1995
·
Jan Krajíček
, Pavel Pudlák
, et al.
·
Random Structures and Algorithms
·
214
Tableau-based model checking in the propositional mu-calculus
1990
·
Rance Cleaveland
·
Acta Informatica
·
206
Show more works
View as search
Works count:
2,254
Citation count:
32,530
Year
Topic
Type