Related papers: Infinite decreasing chains in the Mitchell order
Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…
In the present paper we study necessary and sufficient conditions for the existence of a semicontinuous and finite Richter-Peleg multi-utility for a preorder. It is well know that, given a preorder on a topological space, if there is a…
Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…
We study a sorting machine consisting of two stacks in series where the first stack has the added restriction such that entries in the stack must be in decreasing order from top to bottom. We give the basis of the class of permutations that…
For a countable, complete, first-order theory $T$, we study $At$, the class of atomic models of $T$. We develop an analogue of $U$-rank and prove two results. On one hand, if some tp(d/a) is not ranked, then there are $2^{\aleph_1}$…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
We consider five divisibility orders on the Stone-\v{C}ech compactification $\beta N$. We find antichains of incompatible elements, and characterize maximal and minimal elements. The main result shows that two of these relations, $\mid_L$…
First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable…
A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $\sigma$-structure is the expansion of a $\sigma$-structure with a…
We force the existence of a chain of length $\omega_3$ in $[\omega_1]^{\omega_1}$ increasing modulo finite. The construction involves symmetric systems of models of two types as side conditions, introduced by the second author. This…
In this article I investigate the phenomenon of minimum models of second-order set theories, focusing on Kelley--Morse set theory $\mathsf{KM}$, G\"odel--Bernays set theory $\mathsf{GB}$, and $\mathsf{GB}$ augmented with the principle of…
We provide a description of the structure of $\aleph_0$-categorical trees and cycle-free partial orders. First the maximal branches of $\aleph_0$-categorical tree are examined, followed by the configuration of the ramification orders, which…
The exponential ordering is exploited in the context of non-auto\-no\-mous delay systems, inducing monotone skew-product semiflows under less restrictive conditions than usual. Some dynamical concepts linked to the order, such as…
In this paper, we compute the first set of ${\cal O}(\alpha_s^2)$ corrections to semi-inclusive deep inelastic scattering structure functions. We start by studying the impact of the contribution of the partonic subprocesses that open at…
Work of Linnell shows that the space of left-orderings of a group is either finite or uncountable, and in the case that the space is finite, the isomorphism type of the group is known---it is what is known as a Tararin group. By defining…
We give in this paper a survey of results obtained in our earlier papers, and state explicitly some problems of further research, for example: are the analytic ranks bounded, or not? Twists of Carlitz modules are parametrized by polynomials…
We present a unified deductive verification framework for first-order temporal properties based on well-founded rankings, where verification conditions are discharged using SMT solvers. To that end, we introduce a novel reduction from…
We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…
This work concerns in part the construction of conformal Jordan cells of infinite rank and their reductions to conformal Jordan cells of finite rank. It is also discussed how a procedure similar to Lie algebra contractions may reduce a…