| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910480470403321 |
|
|
Titolo |
Strategies of polemics in Greek and Roman philosophy / / edited by Sharon Weisser and Naly Thaler |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Leiden ; ; Boston : , : Brill, , [2016] |
|
©2016 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (258 pages) |
|
|
|
|
|
|
Collana |
|
Jerusalem studies in religion and culture, , 1570-078X ; ; Volume 21 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Philosophy, Ancient |
Polemics |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Preliminary Material -- Introduction / Sharon Weisser and Naly Thaler -- The Continuation of Philosophy by Other Means? / André Laks -- The Young Dogs of Eristic: Dialectic and Eristic in the Early Academy / Christopher Shields -- A Hidden Argument in Plato’s Theaetetus / Naly Thaler -- Polemical Arguments about Pleasure: The Controversy within and around the Academy / Charlotte Murgier -- The Politics of Aristotle’s Criticism of Plato’s Republic / Jozef Müller -- Cyrenaics and Epicureans on Pleasure and the Good Life: The Original Debate and Its Later Revivals / Voula Tsouna -- Polemics in Translation: Lucretius / Daniel Marković -- The Perfidious Strategy; or, the Platonists against Stoicism / Mauro Bonazzi -- Vehementia: A Rhetorical Basis of Polemics in Roman Philosophy / Carlos Lévy -- The Art of Quotation: Plutarch and Galen against Chrysippus / Sharon Weisser -- The Invisible Adversary: Anti-Christian Polemic in Proclus’s Commentary on the Republic of Plato / Robert Lamberton -- Index. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Strategies of Polemics in Greek and Roman Philosophy brings together papers written by specialists in the field of ancient philosophy on the topic of polemics. Despite the central role played by polemics in ancient philosophy, the forms and mechanisms of philosophical polemics are not usually the subject of systematic scholarly attention. |
|
|
|
|
|
|
|
|
|
|
|
|
|
The present volume seeks to shed new light on familiar texts by approaching them from this neglected angle. The contributions address questions such as: What is the role of polemic in a philosophical discourse? What were the polemical strategies developed by ancient philosophers? To what extent did polemics contribute to the shaping of important philosophical doctrines or standpoint? |
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910872744003321 |
|
|
Titolo |
1994 IEEE-IMS Workshop on Information Theory and Statistics |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
[Place of publication not identified], : IEEE, 1995 |
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Sommario/riassunto |
|
The author describes analogous coding theorems for the more general, interactive, communications required in computation. In this case the bits transmitted in the protocol are not known to the processors in advance but are determined dynamically. First he shows that any interactive protocol of length T between two processors connected by a noiseless channel can be simulated, if the channel is noisy (a binary symmetric channel of capacity C), in time proportional to T 1/C, and with error probability exponentially small in T. He then shows that this result can be extended to arbitrary distributed network protocols. He shows that any distributed protocol which runs in time T on a network of degree d having noiseless communication channels, can, if the channels are in fact noisy, be simulated on that network in time proportional to T 1/C log d. The probability of failure of the protocol is exponentially small in T. |
|
|
|
|
|
|
|
| |