✦ LIBER ✦

On the complexity of cutting-plane proofs

✍ Scribed by W. Cook; C.R. Coullard; Gy. Turán

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 881 KB
Volume: 18
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90039-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Depth of proofs, depth of cut-formulas a

Depth of proofs, depth of cut-formulas and complexity of cut formulas

✍ Wenhui Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 922 KB

Discontinuities across cuts in the compl

Discontinuities across cuts in the complex angular momentum plane

✍ R.G. Newton 📂 Article 📅 1963 🏛 Elsevier Science ⚖ 151 KB

Upper bound on the lengthening of proofs

Upper bound on the lengthening of proofs by cut elimination

✍ V. P. Orevkov 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 689 KB

The Number of Plane Corner Cuts

✍ Sylvie Corteel; Gaël Rémond; Gilles Schaeffer; Hugh Thomas 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 61 KB

In this article we give a generating function for the number # 2 n cut of plane corner cuts with respect to their size and prove that there exist two positive constants c and c such that, for all n > 1, We rely on [Onn-Sturmfels] for motivations for this work and we simply recall the following defi

A note on the shape of the shear-plane i

A note on the shape of the shear-plane in orthogonal cutting

✍ E. Mot; P.C. Veenstra 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 176 KB

The complexity of plane hyperbolic incid

The complexity of plane hyperbolic incidence geometry is ∀∃∀∃

✍ Victor Pambuccian 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

We show that plane hyperbolic geometry, expressed in terms of points and the ternary relation of collinearity alone, cannot be expressed by means of axioms of complexity at most ∀∃∀, but that there is an axiom system, all of whose axioms are ∀∃∀∃ sentences. This remains true for Klingenberg's genera