Related papers: Notes on the ordered set $A^A$. Part III. Exponent…

In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…

In this paper, we investigate relationships between $|\seq(A)|$ and $|\Part_{\fin}(A)|$ in the absence of the Axiom of Choice, where $\seq(A)$ is the set of finite sequences of elements in a set $A$ and $\Part_{\fin}(A)$ is the set of…

This paper discusses the notion of a deformation quantization for an arbitrary polynomial Poisson algebra A. We examine the Hochschild cohomology group H^3(A) and find that if a deformation of A exists it can be given by bidifferential…

We present a modification of the superposition calculus that is meant to generate consequences of sets of first-order axioms. This approach is proven to be sound and deductive-complete in the presence of redundancy elimination rules,…

Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies between lexicographically ordered sets of tuples. We…

We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…

We classify the countable linear orders $X$ for which there is an order $A$ with at least two points such that the lexicographic product $AX$ is isomorphic to $X$. Given such an $X$, we determine every corresponding order $A$, and identify…

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

This is the second in a series math.AG/0312190, math.AG/0410267, math.AG/0410268 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite collection of…

Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we enumerate graded (3+1)-avoiding posets for both reasonable…

We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…

We prove the undecidability of the third order pattern matching problem in typed lambda-calculi with dependent types and in those with type constructors by reducing the second order unification problem to them.

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

An element of a group is said to be reversible if it is conjugate to its inverse. We characterise the reversible elements in the group of diffeomorphisms of the real line, and in the subgroup of order preserving diffeomorphisms.

A decomposition theorem for the Lind zeta function of a reversal system $(X, T, R)$ of finite order is established. A reversal system can be regarded as an action of a certain group $G$ on $X$. To establish an explicit formula for the Lind…

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path…

We derive the explicit formula for the inverse of zeta matrix for any graded posets with the finite set of minimal elements . The combinatorial interpretation of this result is given. For that to do special number theoretic code triangles…