We investigate adverbial agreement in Sandəmarkesə (S. Marco in Lamis, Apulia) proposing phase-bound, local agreement relations, reducible to coordination, as in past and absolute participial constructions, suggesting a copulaless analysis where arguments are subjects in a small clause. With disjunct nominals with matching φ-features, the adverb agrees separately with each part in the set, otherwise resulting in ‘non-agreeing’ forms, which we test also with negative polarity items (niʃun-, ‘nobody’ and nentə, ‘nothing’). With fragment answers, the negation scopes over adverbs (...) agreeing with the two proposed topics: matching of the φ-features of both nouns values the negative operator with the same features. In fronted adverbs, agreement occurs when the question contains overt coordinated arguments, elements continuing a chain, and if coordinated arguments have matching φ-features. In agreement in topical contexts with fronted adverbs, agreement occurs with the aboutness-shift topic closely preceding them, rather than with the embedded direct object. (shrink)

ABSTRACTCorrespondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility relation. If the underlying set of the frame is split into two components,, and, then frames are at the same time the basis for models of non-distributive lattice logic and of two-sorted, residuated modal logic. This suggests that (...) a reduction of the first to the latter may be possible, encoding Positive Lattice Logic as a fragment of Two-Sorted, Residuated Modal Logic. The reduction is analogous to the well-known Gödel-McKinsey-Tarski translation of Intuitionistic Logic into the S4 system of normal modal logic. In this article, we carry out this reduction in detail and we derive some properties of PLL from corresponding properties of First-Order Logic. The reduction we present is extendible to the case of lattices with operators, making use of recent results by this author on the relational representation of normal lattice expansions. (shrink)

We prove decidability of satisfiability of sentences of the monodic packed fragment of first-order temporal logic with equality and connectives Until and Since, in models with various flows of time and domains of arbitrary cardinality. We also prove decidability over models with finite domains, over flows of time including the real order.

By establishing a link between Homer’s, Hesiod’s and Empedocles’ similar textual expressions, we are allotted to assert that the fourth line of Empedocles’ fragment 115 (FVS 31) is authentic. We must read the first words of this line so: ὅς κεν ἑκὼν ἐπίορκον… This emendation of Empedocles’ text implies that the guilty god (or man or Blessed) whom Empedocles’ fragment mentions, is not urged by an (positive or negative) outside element, nor is deceived by a god or a (...) man, acts quite willingly and like the Hatred to which he adheres, and behaves like an human being. However he differs from the disloyal man; for, once punished and cleansed, he is allotted to go back to the society of the Gods or the Blessed, whereas the disloyal man becomes blind or dies, as the myth of the Sicilian Palici testifies. Empedocles refers to this myth when he is speaking over the goddess Nestis. (shrink)

The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting quantifiers are both in NEXPTIME, even when counting quantifiers are coded succinctly.

The Gallus Fragment and the Text of Tibullus 1.10.11.

We introduce proof nets and sequent calculus for the multiplicative fragment of non-commutative logic, which is an extension of both linear logic and cyclic linear logic. The two main technical novelties are a third switching position for the non-commutative disjunction, and the structure of order variety.

We consider the two‐variable fragment of first‐order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NExpTime‐complete. We further show that the corresponding problems for two‐variable first‐order logic with counting and two equivalences are both undecidable.

Inquisitive first order logic is an extension of first order classical logic, introducing questions and studying the logical relations between questions and quantifiers. It is not known whether is recursively axiomatizable, even though an axiomatization has been found for fragments of the logic. In this paper we define the \—classical antecedent—fragment, together with an axiomatization and a proof of its strong completeness. This result extends the ones presented in the literature and introduces a new approach to study the axiomatization (...) problem for fragments of the logic. (shrink)

Dieser Aufsatz liest das während des Ersten Weltkriegs begonnene Lustspiel-Fragment Timon der Redner als einen Versuch Hofmannsthals, ausgehend von der Geldthematik und Figurentypik bei Shakespeare zu einer kritischen Inszenierung des modernen Massenstaates und dessen Sozialdynamiken zu gelangen. Hierbei stützte er sich auf sozialpsychologische Studien Sigmund Freuds und Gustave Le Bons sowie auf Max Webers Herrschaftssoziologie. Als Wirkungsabsicht hinter dieser Ironisierung des allegorisierten Masse-Führermodells zeichnet sich die Re-Etablierung von legitimen Autoritätsstrukturen im Faszinosum der Dichtung ab, welche das Politische authentisch gestaltet.