Related papers: The directed plump ordering
In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure <A, R> can be extended to a well-ordered one. Then we prove that every linear extension of…
A new class of (not necessarily bounded) operators related to (mainly infinite) directed trees is introduced and investigated. Operators in question are to be considered as a generalization of classical weighted shifts, on the one hand, and…
We study sigma-ideals and regularity properties related to the "filter-Laver" and "dual-filter-Laver" forcing partial orders. An important innovation which enables this study is a dichotomy theorem proved recently by Miller [1]. [1] Arnold…
We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…
Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…
We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…
It is a classical theorem that the free product of ordered groups is orderable. In this note we show that, using a method of G. Bergman, an ordering of the free product can be constructed in a functorial manner, in the category of ordered…
In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…
We introduce enriched notions of purity depending on the left class $\mathcal E$ of a factorization system on the base $\mathcal V$ of enrichment. Ordinary purity is given by the class of surjective mappings in the category of sets. Under…
In this paper, nil extensions of some special type of ordered semigroups, such as, simple regular ordered semigroups, left simple and right regular ordered semigroup. Moreover, we have characterized complete semilattice decomposition of all…
We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…
In this paper we introduce appropriate associated function to the sequence $M_p=p^{\t p^{\s}}$, $p\in \N$, $\t>0$, $\s>1$, and derive its sharp asymptotic estimates in terms of the Lambert $W$ function. These estimates are used to prove a…
This paper describes a system, called PLP, for compiling ordered logic programs into standard logic programs under the answer set semantics. In an ordered logic program, rules are named by unique terms, and preferences among rules are given…
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…
In this paper, we introduce D-star order, T-star order and P-star order on the class of dual matrices. By applying matrix decomposition and dual generalized inverses, we discuss properties, characterizations and relations among these…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
Each family $\mathcal{M}$ of means has a natural, partial order (point-wise order), that is $M \le N$ iff $M(x) \le N(x)$ for all admissible $x$. In this setting we can introduce the notion of interval-type set (a subset $\mathcal{I}…
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
We present a systematic study of join-extensions and join-completions of ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from…