Related papers: Partial Order Infinitary Term Rewriting

This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…

In this paper, we introduce a partial order on rings with involution, which is a generalization of the partial order on the set of projections in a Rickart *-ring. We prove that a *-ring with the natural partial order form a sectionally…

Let F be a totally real field and p a rational prime unramified in F. We prove a partial classicality theorem for overconvergent Hilbert modular forms: when the slope is small compared to certain but not all weights, an overconvergent form…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…

The study of combinations of drugs/drug-schedules gained increasing attention in various therapeutic areas recently. In oncology, the aim of phase I combination clinical trial is to find the maximum tolerated combination (MTC). Many…

In arXiv:0905.1675, Nik Weaver proposed a novel intuitionistic formal theory of third-order arithmetic as a formalisation of his philosophical position known as mathematical conceptualism. In this paper, we will construct a realisability…

In Section 6 of the paper ``Fra\"{\i}ss\'{e}'s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition'', we applied the methods developed in earlier sections to show that a certain reduct of the generic…

This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the…

A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We present an illative system I_s of classical higher-order logic with subtyping and basic inductive types. The system I_s allows for direct definitions of partial and general recursive functions, and provides means for handling functions…

Units of measure with prefixes and conversion rules are given a formal semantic model in terms of categorial group theory. Basic structures and both natural and contingent semantic operations are defined. Conversion rules are represented as…

Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving…

The aim of this paper is to generalize the Core Inverse to arbitrary vector spaces using finite potent endomorphisms. As an application, the core partial order is studied in the set of finite potent endomorphisms (of index lesser or equal…

We consider the problem of partial order production: arrange the elements of an unknown totally ordered set T into a target partially ordered set S, by comparing a minimum number of pairs in T. Special cases include sorting by comparisons,…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

We focus here on a class of fourth-order parabolic equations that can be written as a system of second-order equations by introducing an auxiliary variable. We design a novel second-order fully discrete mixed finite element method to…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

We consider an extension of the setting of label ranking, in which the learner is allowed to make predictions in the form of partial instead of total orders. Predictions of that kind are interpreted as a partial abstention: If the learner…