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
39
views
0
references
Top references
cited by
57
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,927
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Studies in Constructive Mathematics and Mathematical Logic Part 2
On the Complexity of Derivation in Propositional Calculus
other
Author(s):
G. S. Tseitin
Publication date
(Print):
1970
Publisher:
Springer US
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):
1970
Pages
: 115-125
DOI:
10.1007/978-1-4899-5327-8_25
SO-VID:
26e1bcbc-72bc-4e26-8e01-b2326dba2e91
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 13
The Computability of Primitive Recursive Terms of Finite Type and Primitive Recursive Realizability
pp. 115
On the Complexity of Derivation in Propositional Calculus
Similar content
5,927
Customer participation in the service process: a model and research propositions
Authors:
Cevahir Uzkurt
,
C Uzkurt
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism
Authors:
J.-J. Lévy
A symbolic calculus for analytic Carleman classes
Authors:
JA Siddiqi
,
M. Ider
See all similar
Cited by
57
Unified QBF certification and its applications
Authors:
Jie-Hong Jiang
,
Valeriy Balabanov
Blocked Clause Elimination for QBF
Authors:
Armin Biere
,
Florian Lonsing
,
Martina Seidl
SAT Solving for Termination Analysis with Polynomial Interpretations
Authors:
Carsten Fuhs
,
Jürgen Giesl
,
Aart Middeldorp
…
See all cited by