𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computability-theoretic and proof-theoretic aspects of partial and linear orderings

✍ Scribed by Rodney G. Downey; Denis R. Hirschfeldt; Steffen Lempp; Reed Solomon

Publisher
The Hebrew University Magnes Press
Year
2003
Tongue
English
Weight
987 KB
Volume
138
Category
Article
ISSN
0021-2172

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A GAME-THEORETIC PROOF OF ANALYTIC RAMSE
A GAME-THEORETIC PROOF OF ANALYTIC RAMSEY THEOREM
✍ Kazuyuki Tanaka πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 217 KB

## Abstract We give a simple game‐theoretic proof of Silver's theorem that every analytic set is Ramsey. A set __P__ of subsets of Ο‰ is called Ramsey if there exists an infinite set __H__ such that either all infinite subsets of __H__ are in __P__ or all out of __P.__ Our proof clarifies a strong c

Theoretical and computational aspects of
Theoretical and computational aspects of a thermodynamically consistent framework for geometrically linear gradient damage
✍ T. Liebe; P. Steinmann; A. Benallal πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 311 KB

This paper presents the theory and the numerics of an isotropic gradient damage formulation within a thermodynamical background. The main motivation is provided by localization computations whereby classical local continuum formulations fail to produce physically meaningful and numerically convergin