Mathias Barra On some small subrecursive hierarchies . . . . . . . . . . . . . . . . 7 Ulrich Berger Strong normalisation via domain-theoretic computability predicates 9 Guillaume Bonfante Life after “life without cons” . . . . . . . . . . . . . . . . . . . . . 10 Michael Brinkmeier Terms and Operads . . . . . . . . . . . . . . . . . . . . . . . . . . 15 Folke Eisterlehner An alternative correc...

Sign patterns that require exponential nonnegativity are characterized. A set of conditions necessary for a sign pattern to require eventual exponential nonnegativity are established. It is shown that these conditions are also sufficient for an upper triangular sign pattern to require eventual exponential nonnegativity and it is conjectured that these conditions are both necessary and sufficien...

Sign patterns that require exponential nonnegativity are characterized. A set of conditions necessary for a sign pattern to require eventual exponential nonnegativity are established. It is shown that these conditions are also sufficient for an upper triangular sign pattern to require eventual exponential nonnegativity and it is conjectured that these conditions are both necessary and sufficien...

Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is transferred by the skew Robinson-Schensted correspondence invented by Sagan and Stanley. The result is a remarkably simple generalization of the ordinary non-skew formula. The sum of the signs of all standard tableaux ...

Valdis Laan in [5] introduced an extension of strong flatness which is called weak pullback flatness. In this paper we introduce a new property of acts over monoids, called U-WPF which is an extension of weak pullback flatness and give a classification of monoids by this property of their acts and also a classification of monoids when this property of acts implies others. We also show that regu...

This work studies the maximum possible sign rank of sign (N ×N)-matrices with a given Vapnik-Chervonenkis dimension d. For d = 1, this maximum is three. For d = 2, this maximum is Θ̃(N). For d > 2, similar but slightly less accurate statements hold. The lower bounds improve on previous ones by Ben-David et al., and the upper bounds are novel. The lower bounds are obtained by probabilistic constr...