Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
37
views
0
references
Top references
cited by
39
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,175
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automation of Reasoning
On the Complexity of Derivation in Propositional Calculus
other
Author(s):
G. S. Tseitin
Publication date
(Print):
1983
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book Chapter
Publication date (Print):
1983
Pages
: 466-483
DOI:
10.1007/978-3-642-81955-1_28
SO-VID:
d4fc7898-b82b-447d-b02e-d75a9ac3077b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 342
Simple Word Problems in Universal Algebras
pp. 466
On the Complexity of Derivation in Propositional Calculus
Similar content
2,175
Untenable propositions and alternative avenues.
Authors:
Alex Thornton
,
Alex Mesoudi
Koepke Machines and Satisfiability for Infinitary Propositional Languages
Authors:
Merlin Carl
,
Benedikt Löwe
,
Benjamin G. Rin
Propositions d’actions futures
Authors:
See all similar
Cited by
39
Inprocessing Rules
Authors:
Matti Järvisalo
,
Marijn Heule
,
Armin Biere
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
Authors:
Nathan Wetzler
,
Marijn Heule
,
Warren A. Hunt
Some (in)translatability results for normal logic programs and propositional theories
Authors:
Tomi Janhunen
See all cited by