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

“I see two suns” Some remarks on the image of a hallucinating satyr by the Kleophrades Painter (Malibu 85.AE.188)

View through CrossRef
AbstractThe article considers two fragments of a vase painting by the Kleophrades Painter which display images of a satyr and a sleeping maenad, respectively. Even the words of the satyr are preserved by a fragmentary inscription that largely coincide with those uttered by Pentheus in v. 918 of Euripides' Bacchae. In view of the unique correspondence between picture and play, apparently overlooked by Euripidean scholarship, the study seeks to reevaluate earlier assumptions about the psychological and ritual background of Pentheus' words.
Title: “I see two suns” Some remarks on the image of a hallucinating satyr by the Kleophrades Painter (Malibu 85.AE.188)
Description:
AbstractThe article considers two fragments of a vase painting by the Kleophrades Painter which display images of a satyr and a sleeping maenad, respectively.
Even the words of the satyr are preserved by a fragmentary inscription that largely coincide with those uttered by Pentheus in v.
918 of Euripides' Bacchae.
In view of the unique correspondence between picture and play, apparently overlooked by Euripidean scholarship, the study seeks to reevaluate earlier assumptions about the psychological and ritual background of Pentheus' words.

Related Results

Saving the Planet with Barbie?
Saving the Planet with Barbie?
In 2019, Mattel introduced a series of Barbie dolls in connection with National Geographic which included a Polar Marine Biologist, an Entomologist, a Wildlife Photojournalist, and...
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...
Birecognition of prime graphs, and minimal prime graphs
Birecognition of prime graphs, and minimal prime graphs
Given a graph [Formula: see text], a subset [Formula: see text] of [Formula: see text] is a module of [Formula: see text] if for each [Formula: see text], [Formula: see text] is ad...
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...
Structural, elastic, magnetic and electronic properties of Ti-based Heusler alloys
Structural, elastic, magnetic and electronic properties of Ti-based Heusler alloys
The structural, elastic, magnetic and electronic properties of titanium-based alloys [Formula: see text] [Formula: see text], [Formula: see text] and [Formula: see text] are invest...
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 ...
T-Coloring of product graphs
T-Coloring of product graphs
Given a graph [Formula: see text] and a finite set [Formula: see text] of positive integers containing [Formula: see text] a [Formula: see text]-coloring of [Formula: see text] is ...
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