There are two ways of incorporating temporal distinctions into a system of logic: tensed theories propose to expand standard logic with intensional tense operators; tenseless theories try to make do with the resources of extensional first-order logic, by using quantification over suitably chosen temporal entities, such as metaphysically basic time points or temporal parts. My concern in this pa...

Guadeloupe left its status as a colony to become French department with the “assimilation” law of 19 March 1946. Twenty years later, promise republican equality associated this change is largely disappointed. Affected by events “May ‘67”, when state violently repressed demonstrations in Pointe-à-Pitre, generation at origin medico-social sector study France tense political context. An analysis e...

We prove that every place of an algebraic function eld of arbitrary characteristic admits a local uniformization in a nite extension of the function eld. We give a valuation theoretical description of these extensions; in certain cases, they can be found in the henselization of the function eld. For places satisfying the Abhyankar equality and for discrete rational places, no extension is neede...

The theory and practice of polytypic programming is intimately connected with the initial algebra semantics of datatypes. This is both a blessing and a curse. It is a blessing because the underlying theory is beautiful and well developed. It is a curse because the initial algebra semantics is restricted to so-called regular datatypes. Recent work by R. Bird and L. Meertens [3] on the semantics ...

We show that the set of cluster monomials for the cluster algebra of type D4 contains a basis of the Z-module Z[x1,1, . . . , x3,3]. We also show that the transition matrices relating this cluster basis to the natural and the dual canonical bases are unitriangular and nonnegative. These results support a conjecture of Fomin and Zelevinsky on the equality of the cluster and dual canonical bases....

We discuss a formal many-valued logic called EQlogic which is based on a recently introduced special class of algebras called EQ-algebras. The latter have three basic binary operations (meet, multiplication, fuzzy equality) and a top element and, in a certain sense, generalize residuated lattices. The goal of EQ-logics is to present a possible direction in the development of mathematical logics...

Barrett et al. asked in [W. Barrett et al. Minimum rank of edge subdivisions of graphs. Electronic Journal of Linear Algebra, 18:530–563, 2009.], whether the maximum nullity is equal to the zero forcing number for all complete subdivision graphs. We prove that this equality holds. Furthermore, we compute the value of M(F, G̊) = Z(G̊) by introducing the bridge tree of a connected graph. Since this...

The paper considers an early approach toward a (fuzzy) set theory with a graded membership predicate and a graded equality relation which had been developed by the German mathematician D. Klaua in 1965. In the context of the mathematical fuzzy logic MTL of left-continuous t-norms we discuss some properties of these graded relations. We compare the simultaneous recursive definitions of these rel...

We give a geometric proof of the upper bound of q2n+1 +1 on the size of partial spreads in the polar space H(4n+1, q2). This bound is tight and has already been proved in an algebraic way. Our alternative proof also yields a characterization of the partial spreads of maximum size in H(4n+ 1, q2).