Skip to main content
SpringerLink
Log in

Quantified Propositional Logic and the Number of Lines of Tree-Like Proofs

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

There is an exponential speed-up in the number of lines of the quantified propositional sequent calculus over Substitution Frege Systems, if one considers proofs as trees. Whether this is true also for the number of symbols, is still an open problem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Mathématiques/Informatique, Université de Paris XII, 61 Avenue du Général de Gaulle, 94010, Créteil CEDEX, France

    Alessandra Carbone

Authors
  1. Alessandra Carbone
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carbone, A. Quantified Propositional Logic and the Number of Lines of Tree-Like Proofs. Studia Logica 64, 315–321 (2000). https://doi.org/10.1023/A:1005281425560

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005281425560

Search

Navigation