Tacitus and C. Licinius Mucianus

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

W. Altman

引用次数: 0

Abstract

Resumo: Baseando-se nas ideias de Ronald Syme sobre a simpatia de Tacito por Marcelo Eprio, assim como no trabalho de Dylan Sailor, que revela a postura critica do historiador em relacao a Helvidio Prisco, este artigo mostra por que a descricao de Muciano e importante tanto para combinar quanto para confirmar essas duas vertentes interpretativas. Apresentado como “criador de reis” a Vespasiano, Muciano – ou melhor, o retrato que Tacito faz dele – revela-se um guia crucial, embora negligenciado, para os metodos e as simpatias do historiador cuja carreira dependia da Dinastia Flaviana e que decidiu contar seus feitos em suas Historias.

查看原文

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

本刊更多论文

塔西佗和C.李锡尼

摘要:罗纳德姆的想法基于同情的Tacito马塞洛Eprio,迪伦·邓恩在工作一样,显示了对历史学家的批评立场Helvidio遗体,这篇文章显示了描述为什么Muciano和重要的安排和确认这两个方面转化。作为维斯帕先的“国王的创造者”，穆西亚努斯——或者更确切地说，塔西佗对他的描述——被证明是这位历史学家的方法和同情的一个至关重要的指南，尽管被忽视了，这位历史学家的职业生涯依赖于弗拉维王朝，并决定在他的历史中讲述他的成就。

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

求助全文

约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