So E. J. Kenney in the OCT Appendix Vergiliana . The same scholar has now given us his secundae curae in The Ploughman's Lunch. Moretum. A Poem Ascribed to Virgil , which was on its way in luminis oras when the sibling edition of A. Perutelli, [P. Vergili Maronis] Moretum , saw the light of day. Only three words of line 15 are above any kind of suspicion: et reserat…ostia…, ‘and he unbars the door’ , some door, that (...) is, which he, Simulus, prouidus heros , must open to reach a pile of grain not left exposed outside his cottage, but stored somewhere. clauis is semantically unobjectionable in close association with reserat: cf. Petronius 94.7f. Eumolpus…limen egressus adduxit repente ostium cellae…exemitque raptim clauem…reseratis foribus intrat Eumolpus. But here it strangely overemphasises the internal security of the cottage, whose only other occupant was the slave-woman Scybale, and she, unlike the usual run of pilfering servants , was its unica custos . More important, claui usurps the place which sense and style alike require for the substantive qualified by the participle clausae. , 438, suggested that it was a substantive. It is indeed easy, as Perutelli observes, to encounter in medieval Latin the noun clausa > Old French close > English closet, parallel to clausu > French clos. (shrink)

In the traditional view, Martial’s epigram 9. 33 makes fun of a fictive character named Maro, who - thanks to his oversized phallus - is applauded in the baths. This paper argues that the real concern of the poem are not physical body parts, but a literary corpus of obscene texts featuring the notorious mentula, namely the Priapea attributed to P. Vergilius Maro.

We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...) models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)

We develop and apply a multi-dimensional conception of explanatory depth towards a comparative analysis of inflationary and bouncing paradigms in primordial cosmology. Our analysis builds on earlier work due to Azhar and Loeb (2021) that establishes initial condition fine-tuning as a dimension of explanatory depth relevant to debates in contemporary cosmology. We propose dynamical fine-tuning and autonomy as two further dimensions of depth in the context of problems with instability and trans-Planckian modes that afflict bouncing and inflationary approaches respectively. In (...) the context of the latter issue, we argue that the recently formulated trans-Planckian censorship conjecture leads to a trade-off for inflationary models between dynamical fine-tuning and autonomy. We conclude with the suggestion that explanatory preference with regard to the different dimensions of depth is best understood in terms of differing attitudes towards heuristics for future model building. (shrink)

We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of $\Sum_{3}^{0}$.

We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.