Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

I will not see his like again: Remembering Salman Schocken (1968)

View through CrossRef
Abstract After Salman Schocken’s death in 1959, public portrayals and obituaries praised the entrepreneur and philanthropist’s accomplishments. In 1967, Salman Schocken’s son Gershom Schocken wrote an essay reframing these earlier portraits. It took the accomplished journalist eight years to come to terms with this task, in his newspaper Haaretz, on the occasion of the 90th anniversary of Salman Schocken’s birth. Some months later, an extended version of the text appeared in the German monthly Der Monat, translated into German by Gershom Schocken himself. Provided here is an abridged English translation of the German version of Schocken’s memories, accompanied by a brief commentary explaining the text’s relevance in the context of the Year Book’s special section on Salman Schocken’s collections.
Title: I will not see his like again: Remembering Salman Schocken (1968)
Description:
Abstract After Salman Schocken’s death in 1959, public portrayals and obituaries praised the entrepreneur and philanthropist’s accomplishments.
In 1967, Salman Schocken’s son Gershom Schocken wrote an essay reframing these earlier portraits.
It took the accomplished journalist eight years to come to terms with this task, in his newspaper Haaretz, on the occasion of the 90th anniversary of Salman Schocken’s birth.
Some months later, an extended version of the text appeared in the German monthly Der Monat, translated into German by Gershom Schocken himself.
Provided here is an abridged English translation of the German version of Schocken’s memories, accompanied by a brief commentary explaining the text’s relevance in the context of the Year Book’s special section on Salman Schocken’s collections.

Related Results

Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Bounds on the sum of broadcast domination number and strong metric dimension of graphs
Let [Formula: see text] be a connected graph of order at least two with vertex set [Formula: see text]. For [Formula: see text], let [Formula: see text] denote the length of an [Fo...
MODEL PENGELOLAAN DAN PEMBERDAYAAN EKONOMI UMAT DI MASJID SALMAN ITB
MODEL PENGELOLAAN DAN PEMBERDAYAAN EKONOMI UMAT DI MASJID SALMAN ITB
AbstractThe purpose of this study is to find out what the potential of the Salman ITB Mosque is, to find out how the economic management of the people at the Salman ITB Mosque is, ...
Salman Schocken. Topographien eines Lebens
Salman Schocken. Topographien eines Lebens
Ein Leben im Dazwischen Salman Schocken war ein Selfmademan. Aufgewachsen in bescheidenen Verhältnissen in der Nähe von Posen, folgte er dem Ruf seines Bruders in die sächsische S...
Shmuel Yosef Agnon
Shmuel Yosef Agnon
On August 8, 1887, Shmuel Yosef was born in Buchach, Galicia (today located in Ukraine) to Shalom Mordechai and Esther Czaczkes, the family being a traditional, religious observant...
A saturation problem in meshes
A saturation problem in meshes
Let [Formula: see text] and [Formula: see text] be graphs, where we view [Formula: see text] as the “host” graph and [Formula: see text] as a “forbidden” graph. A spanning subgraph...
When is R[θ] integrally closed?
When is R[θ] integrally closed?
Let [Formula: see text] be an integrally closed domain with quotient field [Formula: see text] and [Formula: see text] be an element of an integral domain containing [Formula: see ...
La Biblioteca Schocken di Erich Mendelsohn a Gerusalemme
La Biblioteca Schocken di Erich Mendelsohn a Gerusalemme
Nel 1934, poco dopo il suo arrivo in Palestina, Erich Mendelshon riceve da Salman Schocken l’incarico per la costruzione di una villa e una biblioteca nel quartiere di Rehavia, a G...
Inductive graph invariants and approximation algorithms
Inductive graph invariants and approximation algorithms
We introduce and study an inductively defined analogue [Formula: see text] of any increasing graph invariant [Formula: see text]. An invariant [Formula: see text] is increasing if ...

Back to Top