Publications
Preprints
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
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
Information for reviewers
Review process
How to peer review
Peer review policy
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

Register Dashboard
Search
8
views
8
references
 Top references
cited by
1
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,014
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Logic Colloquium '98 

      On the Bit-Comprehension Rule

      edited-book
      Author(s): ,
      Publication date:
      Publisher: Cambridge University Press

      Read this book at

      Publisher
      Buy book
      Bookmark
          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

          Most cited references8

          • Record: found
          • Abstract: not found
          • Article: not found

          On uniformity within NC1

          David Mix Barrington, Neil Immerman, Howard Straubing (1990)
          Article 0 comments Cited 50 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Book: not found

            Bounded Arithmetic, Propositional Logic and Complexity Theory

            Jan Krajíček (2009)
            Book 0 comments Cited 9 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Bounded arithmetic and the polynomial hierarchy

              Jan Krajíček, Pavel Pudlak, Gaisi Takeuti (1991)
              Article 0 comments Cited 8 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date: March 31 2017
                Pages: 262-279
                DOI: 10.1017/9781316756140.019
                SO-VID: a26757c9-786c-4ef9-9d26-e17739f19de7
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content2,014

                See all similar

                Cited by1

                See all cited by