Related papers: Well ordering principles and bar induction
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…
We propose an order parameter for the one dimensional Mott-Hubbard transition and provide numerical evidence and general theoretical arguments for the correctness of our proposal. In addition, we discuss some of the implications of this…
A pre-order and equivalence relation on the class of positive real Hilbert space operators are introduced, in correspondence with similar relations for contraction operators defined by Yu.L. Shmul'yan in [7]. It is shown that the pre-order,…
Like notions of process equivalence, behavioural preorders on processes come in many flavours, ranging from fine-grained comparisons such as ready simulation to coarse-grained ones such as trace inclusion. Often, such behavioural preorders…
In this paper, we build some ergodic theorems involving function $\Omega$, where $\Omega(n)$ denotes the number of prime factors of a natural number $n$ counted with multiplicities. As a combinatorial application, it is shown that for any…
Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which, in addition, satisfies a given specification.…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
Given an Archimedean order unit space (V,V^+,e), we construct a minimal operator system OMIN(V) and a maximal operator system OMAX(V), which are the analogues of the minimal and maximal operator spaces of a normed space. We develop some of…
We established order-preserving versions of the basic principles of functional analysis such as Hahn-Banach, Banach-Steinhaus, open mapping and Banach-Alaoglu theorems.
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
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 prove that the Bernardi Integral Operator maps certain classes of bounded starlike functions into the class of convex functions, improving the result of Oros and Oros. We also present a general unified method for investigating various…
We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…
In some previous works, two of the authors introduced a technique to design high-order numerical methods for one-dimensional balance laws that preserve all their stationary solutions. The basis of these methods is a well-balanced…
In this paper, we investigate a rather general system of two operator equations that has the structure of a viscous or nonviscous Cahn--Hilliard system in which nonlinearities of double-well type occur. Standard cases like regular or…
Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…
In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…
Standard ordinal allocation methods ignore how strongly agents value different improvements, while cardinal methods require additional assumptions that are often considered too demanding. This paper studies assignment problems in the middle…
Induction in saturation-based first-order theorem proving is a new exciting direction in the automation of inductive reasoning. In this paper we survey our work on integrating induction directly into the saturation-based proof search…
The $\alpha$-induction of graded local conformal nets is studied. We show that inclusions of graded local conformal nets give rise to braided subfactors so that the $\alpha$-induction is still effective for graded local conformal nets. As…