Related papers: The theorem of the complement for nested subpfaffi…
Let $K$ be a complete discrete valued field of characteristic $p$ with residue $k$ which is not necessarily perfect. We prove the Conjecture in \cite{cs} that a $p$-algebra over $K$ contains a totally ramified cyclic maximal subfield if it…
Let L be a restricted Lie superalgebra with its enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We characterize L…
This paper investigates under which conditions instantiation-based proof procedures can be combined in a nested way, in order to mechanically construct new instantiation procedures for richer theories. Interesting applications in the field…
The purpose of this paper is to define semi- and subanalytic subsets and maps in the context of real analytic orbifolds and to study their basic properties. We prove results analogous to some well-known results in the manifold case. For…
The postcritical set $P(f)$ of a rational map $f:\mathbb P^1\to \mathbb P^1$ is the smallest forward invariant subset of $\mathbb P^1$ that contains the critical values of $f$. In this paper we show that every finite set $X\subset \mathbb…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…
Let $p$ be prime. Let $L/K$ be a finite, totally ramified, purely inseparable extension of local fields, $\left[ L:K\right] =p^{n},\;n\geq2.$ It is known that $L/K$ is Hopf Galois for numerous Hopf algebras $H,$ each of which can act on the…
The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…
The Hilbert scheme $\mathbf{Hilb}_{p(t)}^{n}$ parametrizes closed subschemes and families of closed subschemes in the projective space $\mathbb{P}^n$ with a fixed Hilbert polynomial $p(t)$. It is classically realized as a closed subscheme…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
A leaf path language is a Boolean combination of sets of the form $\mathsf{{}^mE}^k L$, with $k \ge 1$ and $L$ a regular word language, which consist of those forests where the node labels in at least $k$ leaf-to-root paths make up a word…
We use cell decomposition techniques to study additive reducts of p- adic fields. We consider a very general class of fields, including fields with infinite residue fields, which we study using a multi-sorted language. The results are used…
We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…
The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…
The importance of subtyping to enable a wider range of well-typed programs is undeniable. However, the interaction between subtyping, recursion, and polymorphism is not completely understood yet. In this work, we explore subtyping in a…
Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…
In [7, Papadima and Suciu, When does the associated graded Lie algebra of an arrangement group decompose? Comment. Math. Helv. {\bf 81:4} (2006), 859--875] it is proved that the holonomy Lie algebra of an arrangement of hyperplanes through…