Conservative fragments of S^1_2 and R^1_2
The paper studies weak fragments of Buss's theories of bounded arithmetic. One of the main problems in the area is to separate levels of Buss's hierarchy. While the general problem is considered very difficult due to its connection to major unsolved questions in computational complexity theory (collapse of the polynomial hierarchy), there is some hope that we might be able to directly separate theories at the lower end of the hierarchy. The author is particularly interested in the question whether \(R^1_2\neq S^1_2\), and to this end he investigates low-complexity fragments (such as \(\Sigma^b_0\), \(\hat\Sigma^b_1\)) of \(R^1_2\), \(S^1_2\), and related theories. The paper defines theories \(T^{-1,\tau}_2\) characterizing the \(\forall\Sigma^b_0\) consequences of \(T^{0,\tau}_2\) (= \(\Sigma^b_0\)-induction for numbers bounded by a term from \(\tau\)); in particular, \(T^{-1}_2\) is the \(\forall\Sigma^b_0\) fragment of \(T^0_2\) and \(S^1_2\). Then the author presents function algebras \(\mathcal A\Sigma^\tau_\infty\) and proves a witnessing theorem for a certain class of theories (including \(T^{-1,\tau}_2\)) with respect to these algebras. As a special case, this gives a description of \(\Sigma^b_0\)-definable functions of \(T^{-1}_2\); the relevant algebra is then shown not to contain division by \(3\), which implies \(T^{-1}_2\neq T^0_2\), and, by a similar argument, \(R^1_2\) is not \(\forall\hat\Sigma^b_1\)-conservative over \(T^{0,\tau}_2\) for suitable \(\tau\). In the next section, the author introduces theories \(\text{TComp}^\tau\) based on open comprehension axioms allowing for a controlled amount of recursive dependence in the defining formulas. The main result is a witnessing theorem which implies, among others, that \(R^1_2\) is \(\forall\hat\Sigma^b_1\)-conservative over \(\text{TComp}^{\{||\text{id}||\}}\), \(\hat C^0_2\) is \(\forall\hat\Sigma^b_1\)-conservative over \(\text{TComp}^{\{\text{cl}\}}\), and \(T^0_2\) can be axiomatized by induction for sharply bounded \(\exists\forall\)-formulas.
- Conserved charges of non-Yangian type for the Frahm-Polychronakos spin chain
- SO(r+2,r) pure spinors
- Conserved quantities from pseudotensors and extremum theorems for angular momentum
- Conserved quantities and solutions of a (2+1)-dimensional Hǎrǎgus-Courcelle-Il'ichev model
- Contracted Hamiltonian on symmetric space \(SU(3)/SU(2)\) and conserved quantities
- Two types of conserved quantities of Lie-Mei symmetry for a variable mass system in phase space
- CONSERVATION LAWS FOR SO(p,q)
- scientific article; zbMATH DE number 1665423
- scientific article; zbMATH DE number 1129881
- A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications
- Arithmetizing uniform NC
- Bootstrapping. I
- Bounded arithmetic and the polynomial hierarchy
- Characterising definable search problems in bounded arithmetic via proof notations
- Circuits in bounded arithmetic. I
- Fragments of bounded arithmetic and the lengths of proofs
- Herbrandizing search problems in Bounded Arithmetic
- scientific article; zbMATH DE number 440478 (Why is no real title available?)
- scientific article; zbMATH DE number 440487 (Why is no real title available?)
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 806747 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 1420845 (Why is no real title available?)
- scientific article; zbMATH DE number 3248030 (Why is no real title available?)
- Logical foundations of proof complexity
- Multifunction algebras and the provability of PH
- NP search problems in low fragments of bounded arithmetic
- On the bounded version of Hilbert's tenth problem
- Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic
- Structure and definability in general bounded arithmetic theories
- The strength of sharply bounded induction
- The strength of sharply bounded induction requires MSP
- What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)?
- A note on uniform density in weak arithmetical theories
- Bounded arithmetic in free logic
- scientific article; zbMATH DE number 440477 (Why is no real title available?)
- A Remark on Independence Results for Sharply Bounded Arithmetic
- An unexpected separation result in Linearly Bounded Arithmetic
- scientific article; zbMATH DE number 1420845 (Why is no real title available?)
- On the finite axiomatizability of \(\forall\hat{\Sigma}^{\mathrm{b}}_1 (\hat{\mathsf{R}}^1_2)\)
- Fragments of bounded arithmetic and the lengths of proofs
- scientific article; zbMATH DE number 963569 (Why is no real title available?)
This page was built for publication: Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535152)