✦ LIBER ✦

On Computer-Assisted Proofs in Ordinal Number Theory

✍ Scribed by Johan G. F. Belinfante

Book ID: 110231271
Publisher: Springer Netherlands
Year: 1999
Tongue: English
Weight: 131 KB
Volume: 22
Category: Article
ISSN: 0168-7433
DOI: 10.1023/a:1006010913494

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computer-assisted proofs in analysis

✍ Oscar E. Lanford III 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Theories and Ordinals in Proof Theory

✍ Michael Rathjen 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 393 KB

Mathematical Proof Theory in the Light o

Mathematical Proof Theory in the Light of Ordinal Analysis

✍ Reinhard Kahle 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 133 KB

Proof Assistance for Refinement in Type

Proof Assistance for Refinement in Type Theory

✍ Nikos Mylonakis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

The Suslin operator in applicative theor

The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories

✍ Gerhard Jäger; Dieter Probst 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 306 KB

On convexity proofs in location theory

✍ Robert F. Love; James G. Morris 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

It is often assumed in the facility location literature that functions of the type +i(z, y) =p,{(zj-z)\*+ (yi-y)a]R/s are twice differentiable. Here we point out that this is true only for certain values of K. Convexity proofs that are independent of the value of K are given. DIFFERENTIABILITY Consi