✦ LIBER ✦

The number of lines in Frege proofs with substitution

✍ Scribed by Alasdair Urquhart

Publisher: Springer
Year: 1997
Tongue: English
Weight: 74 KB
Volume: 37
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s001530050078

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The polynomial bounds of proof complexit

The polynomial bounds of proof complexity in Frege systems

✍ S. R. Aleksanyan; A. A. Chubaryan 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 131 KB

The number of proof lines and the size o

The number of proof lines and the size of proofs in first order logic

✍ Jan Krajíček; Pavel Pudlák 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 810 KB

Dynamic expression of nine QTLs for till

Dynamic expression of nine QTLs for tiller number detected with single segment substitution lines in rice

✍ Guifu Liu; Ruizhen Zeng; Haitao Zhu; Zemin Zhang; Xiaohua Ding; Fangming Zhao; W 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 333 KB

The Mean Number of Extreme Lines in a Co

The Mean Number of Extreme Lines in a Convex Hull of Lines

✍ Gates 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 140 KB

On the number of lines in planar spaces

✍ Klaus Metsch 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 269 KB

2-factors with the bounded number of com

2-factors with the bounded number of components in line graphs

✍ Liming Xiong 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Let G be a simple graph of order n such that every vertex of degree 1 is adjacent to a vertex of degree at least 3. In this work, we prove that the line graph L(G) has a 2-factor with at most n-1 3 components if every odd branch-bond of G has a shortest branch of length 2. This is a best possible re