Cycling in proofs and feasibility

@inproceedings{Carbone2000CyclingIP,
  title={Cycling in proofs and feasibility},
  author={Alessandra Carbone},
  year={2000}
}
There is a common perception by which small numbers are considered more concrete and large numbers more abstract. A mathematical formalization of this idea was introduced by Parikh (1971) through an inconsistent theory of feasible numbers in which addition and multiplication are as usual but for which some very large number is defined to be not feasible. Parikh shows that sufficiently short proofs in this theory can only prove true statements of arithmetic. We pursue these topics in light of… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 32 REFERENCES

The problem of vague predicates

  • R. Parikh
  • In Language, Logic and Method, R.S. Cohen and M.W…
  • 1983
Highly Influential
16 Excerpts

Linear Logic

  • J. Y. Girard
  • Theoretical Computer Science, 50:1–102,
  • 1987
Highly Influential
3 Excerpts

Geometry, Symmetry and Implicit Representations of Combinatorial Structures

  • A. Carbone, S. Semmes
  • Book in preparation,
  • 1997
1 Excerpt

Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination

  • A. Carbone, S. Semmes
  • In Bulletin of the American Mathematical Society…
  • 1997
1 Excerpt

Proofs and Groups with distorted Length Function

  • A. Carbone
  • Manuscript,
  • 1996
1 Excerpt

Similar Papers

Loading similar papers…