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
0
views
9
references
Top references
cited by
2
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,682
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Gödel ’96
A Bounded Arithmetic Theory for Constant Depth Threshold Circuits
other
Author(s):
Jan Johannsen
Publication date
(Print):
1996
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
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Most cited references
9
Record
: found
Abstract
: not found
Article
: not found
The polynomial-time hierarchy
Larry Stockmeyer
(1976)
0
comments
Cited
119
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On uniformity within NC1
David Mix Barrington
,
Neil Immerman
,
Howard Straubing
(1990)
0
comments
Cited
50
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Bounded Arithmetic
S Buss
,
SR Buss
,
SR BUSS
…
(1986)
0
comments
Cited
10
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1996
Pages
: 224-234
DOI:
10.1007/978-3-662-21963-8_16
SO-VID:
4ef2853c-b67e-40f8-9025-22e73c650897
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Gödel’s program for new axioms: Why, where, how and what?
pp. 23
Infinite-valued Gödel Logics with 0-1-Projections and Relativizations
pp. 34
Contributions of K. Gödel to Relativity and Cosmology
pp. 50
Kurt Gödel and the constructive Mathematics of A.A. Markov
pp. 64
Hao Wang as Philosopher
pp. 81
A bottom-up approach to foundations of mathematics
pp. 98
K-graph Machines: generalizing Turing’s machines and arguments
pp. 120
Forcing on Bounded Arithmetic
pp. 139
Uniform Interpolation and Layered Bisimulation
pp. 167
Gödel’s Ontological Proof Revisited
pp. 173
A Uniform Theorem Proving Tableau Method for Modal Logic
pp. 183
Decidability of the ∃*∀*-Class in the Membership Theory NWL
pp. 195
A Logical Approach to Complexity Bounds for Subtype Inequalities
pp. 205
How to characterize provably total functions by the Buchholz operator method
pp. 214
Completeness has to be restricted: Gödel’s interpretation of the parameter t
pp. 224
A Bounded Arithmetic Theory for Constant Depth Threshold Circuits
pp. 235
Information content and computational complexity of recursive sets
pp. 247
Kurt Gödel and the Consistency of R##
pp. 257
Best possible answer is computable for fuzzy SLD-resolution
pp. 267
The finite stages of inductive definitions
pp. 291
Gödel and the Theory of Everything
pp. 307
Replacement↛ Collection
Similar content
2,682
Arithmetic properties of overpartition triples
Authors:
Liu Wang
Young and older adults' strategies in complex arithmetic
Authors:
P. Lemaire
,
L Arnaud
The influence of quantization and fixed point arithmetic upon the BER performance of turbo codes
Authors:
See all similar
Cited by
2
On the Bit-Comprehension Rule
Authors:
Jan Johannsen
,
Chris Pollett
Theories for TC0 and Other Small Complexity Classes
Authors:
,
See all cited by