On theories of bounded arithmetic for \(\mathrm{NC}^1\) (Q638497): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.apal.2010.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095848489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded arithmetic AID for Frege systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone simulations of non-monotone proofs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some problems on groups input as multiplication tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALOGTIME and a conjecture of S. A. Cook / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic for NC, ALogTIME, L and NL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sorting network in bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on polynomially bounded arithmetic / rank
 
Normal rank

Latest revision as of 11:21, 4 July 2024

scientific article
Language Label Description Also known as
English
On theories of bounded arithmetic for \(\mathrm{NC}^1\)
scientific article

    Statements

    On theories of bounded arithmetic for \(\mathrm{NC}^1\) (English)
    0 references
    0 references
    12 September 2011
    0 references
    In the paper two theories are introduced: \(\mathrm{VNC}_{*}^{1}\) and its variant \(\overline{\mathrm{VNC}}_{*}^{1}\) -- they correspond to a subclass of \(\mathrm{NC}^{1}\) slightly larger than uniform \(\mathrm{NC}^{1}\). The author works with second-order theories in the spirit of Zambella. The theory \(\mathrm{VNC}_{*}^{1}\) is formulated in the usual language of second-order bounded arithmetic and the theory \(\overline{\mathrm{VNC}}_{*}^{1}\) has a richer language. Basic properties of those theories are proved. A general theorem on conservativity of the axiom of choice over theories meeting certain requirements is also proved. It is shown that propositional translations of \(\Sigma^{B}_{0}\) theorems of \(\overline{\mathrm{VNC}}_{*}^{1}\) have \(L\)-uniform polynomial-size Frege proofs.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded arithmetic
    0 references
    circuit complexity
    0 references
    propositional translation
    0 references
    0 references