Conservative fragments of S^1_2 and R^1_2
From MaRDI portal
Publication:535152
DOI10.1007/S00153-010-0220-9zbMATH Open1231.03052OpenAlexW2031918097MaRDI QIDQ535152FDOQ535152
Authors: Chris Pollett 
Publication date: 11 May 2011
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-010-0220-9
Recommendations
- 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
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) First-order arithmetic and fragments (03F30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical foundations of proof complexity
- Title not available (Why is that?)
- Herbrandizing search problems in Bounded Arithmetic
- Bounded arithmetic and the polynomial hierarchy
- Arithmetizing uniform \(NC\)
- Title not available (Why is that?)
- Structure and definability in general bounded arithmetic theories
- Circuits in bounded arithmetic. I
- On the bounded version of Hilbert's tenth problem
- Multifunction algebras and the provability of \(PH\downarrow\)
- Characterising definable search problems in bounded arithmetic via proof notations
- Title not available (Why is that?)
- Title not available (Why is that?)
- The strength of sharply bounded induction
- Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic
- A Model-Theoretic Property of Sharply Bounded Formulae, with some Applications
- NP search problems in low fragments of bounded arithmetic
- Fragments of bounded arithmetic and the lengths of proofs
- Title not available (Why is that?)
- The strength of sharply bounded induction requires MSP
- Bootstrapping. I
Cited In (8)
- Fragments of bounded arithmetic and the lengths of proofs
- Bounded arithmetic in free logic
- A note on uniform density in weak arithmetical theories
- An unexpected separation result in Linearly Bounded Arithmetic
- On the finite axiomatizability of \(\forall\hat{\Sigma}^{\mathrm{b}}_1 (\hat{\mathsf{R}}^1_2)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Remark on Independence Results for Sharply Bounded Arithmetic
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)
