Skip to main content
SpringerLink
Log in

On Rules and Parameter Free Systems in Bounded Arithmetic

  • Conference paper
Computation and Logic in the Real World (CiE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4497))

Included in the following conference series:

  • 1271 Accesses

Abstract

We present model–theoretic techniques to obtain conservation results for first order bounded arithmetic theories, based on a hierarchical version of the well known notion of an existentially closed model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avigad, J.: Saturated models of universal theories. Annals of Pure and Applied Logic 118, 219–234 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bloch, S.: Divide and Conquer in Parallel Complexity and Proof Theory, Ph. D. Thesis. University of California, San Diego (1992)

    Google Scholar 

  3. Buss, S.: Bounded Arithmetic. Bibliopolis, Napoli (1986)

    Google Scholar 

  4. Clote, P., Takeuti, G.: First order bounded artihmetic and small boolean circuit complexity classes. In: Clote, P., Remmel, J (eds.) Feasible Mathematics II, pp. 154–218. Birkhäuser, Boston (1995)

    Google Scholar 

  5. Johannsen, J.: A Bounded Arithmetic Theory for Constant Depth Threshold Circuits. In: Gödel’96. Lecture Notes in Logic, vol. 6, pp. 224–234. Springer, Heidelberg (1996)

    Google Scholar 

  6. Johannsen, J., Pollett, C.: On Proofs About Threshold Circuits and Counting Hierarchies. In: Proc. 13th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos (1998)

    Google Scholar 

  7. Johannsen, J., Pollett, C.: On the \(\Delta_1^b\)–Bit–Comprehension Rule. Logic Colloquium’98. Lecture Notes in Logic, ASL vol. 13, pp. 262–279 (2000)

    Google Scholar 

  8. Krajíček, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  9. Nguyen, P., Cook, S.: Theories for TC 0 and other small complexity classes. Logical Methods in Computer Science 2, 1–40 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Pollett, C.: Structure and Definability in General Bounded Arithmetic Theories. Annals of Pure and Applied Logic 100, 189–245 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sieg, W.: Herbrand Analyses. Archive for Mathematical Logic 30, 409–441 (1991)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad de Matemáticas. Universidad de Sevilla, C/ Tarfia, s/n, 41012 Sevilla, Spain

    Andres Cordòn-Franco, Alejandro Fernández-Margarit & Francisco Felix Lara-Martín

Authors
  1. Andres Cordòn-Franco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alejandro Fernández-Margarit
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francisco Felix Lara-Martín
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. Institue for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, TV Amsterdam, The Netherlands

    Benedikt Löwe

  3. Dipartimento di Scienze Matematiche ed Informatiche “R. Magari”, University of Siena, 53100, Siena, Italy

    Andrea Sorbi

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cordòn-Franco, A., Fernández-Margarit, A., Lara-Martín, F.F. (2007). On Rules and Parameter Free Systems in Bounded Arithmetic. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73001-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73000-2

  • Online ISBN: 978-3-540-73001-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation