UMA PERSPECTIVA HISTÓRICA SOBRE O ÍON DE PLATÃO

IF 0.9 4区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Combinatorics, Probability & Computing Pub Date : 2021-03-09 DOI:10.17074/CPC.V1I39.34691

Hector Garcia de Andrade

引用次数: 0

Abstract

Este artigo apresenta um ponto de vista historico sobre o dialogo platonico Ion , sendo considerada a diferenca do papel exercido pelos poetas na sociedade grega arcaica em relacao a recepcao deles por Platao no periodo classico, representados pela figura do rapsodo. A critica direcionada pelo dialogo a tradicao poetica assinala um processo de laicizacao da poesia, dado o conflito entre os conceitos de entusiasmo e de techne presentes no dialogo e coexistentes na polis classica. A luz das transformacoes sociais por que passou a tradicao poetica, compreende-se a representacao do rapsodo como uma deliberada contradicao.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

柏拉图思想的历史透视

本文从历史的角度来看待柏拉图的对话，考虑到古希腊社会中诗人所扮演的角色与他们在古典时期接受柏拉图的角色之间的差异，以狂想曲为代表。对话对诗歌传统的批判标志着一个诗歌世俗化的过程，因为对话中存在的热情和技术概念之间的冲突，并在古典城邦中共存。鉴于诗歌传统所经历的社会变革，狂想曲的表现被理解为一种蓄意的矛盾。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Combinatorics, Probability & Computing 数学-计算机：理论方法

CiteScore

2.40

自引率

11.10%

发文量

审稿时长

6-12 weeks

期刊介绍： Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

期刊最新文献

Spanning trees in graphs without large bipartite holes Approximate discrete entropy monotonicity for log-concave sums A special case of Vu’s conjecture: colouring nearly disjoint graphs of bounded maximum degree Mastermind with a linear number of queries On oriented cycles in randomly perturbed digraphs