Related papers: A Higher Bachmann-Howard Principle

We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…

Equivalent guiding-center Hamiltonian theories are constructed based on higher-order Lie-transform perturbation methods. Higher-order guiding-center theories are distinguished on the basis of whether correction terms associated with…

We contribute the first denotational semantics of polymorphic dependent type theory extended by an equational theory for general (higher-order) reference types and recursive types, based on a combination of guarded recursion and…

Higher Type Arithmetic (HA$^w$) is a first-order many-sorted theory. It is a conservative extension of Heyting Arithmetic obtained by extending the syntax of terms to all of System T: the objects of interest here are the functionals of…

In this work we present an extension of the technique of the order reduction to higher perturbative approximations in an iterative fashion. The intention is also to analyze more carefully the conditions for the validity of the order…

Seeking the largest solution to an expression of the form A x <= B is a common task in several domains of engineering and computer science. This largest solution is commonly called quotient. Across domains, the meanings of the binary…

A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

In this paper we give an ordinal analysis of a set theory with $\Pi_{1}$-Collection.

In this paper, we examine several issues for ordering or partially ordering elements of hyper-powertsets involved in the recent theory of plausible, uncertain and paradoxical reasoning (DSmT or Dezert-Smarandache Theory) developed by the…

Many real world problems naturally appear as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two techniques: some direct propagation of constraints between…

Multinomial processing tree (MPT) models are tools for disentangling the contributions of latent cognitive processes in a given experimental paradigm. The present note analyzes MPT models subject to order constraints on subsets of its…

We formulate a well-posedness and approximation theory for a class of generalised saddle point problems. In this way we develop an approach to a class of fourth order elliptic partial differential equations using the idea of splitting into…

We propose an arbitrarily higher (even) order implicit leapfrog scheme for time discretization of a three-field formulation of Maxwell's equations. We use this in conjunction with an arbitrarily higher-order and compatible discretization…

Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations…

In this paper, we establish a partial order principle, which is useful to deriving vector Ekeland variational principle (denoted by EVP). By using the partial order principle and extending Gerstewitz's functions, we obtain a vector EVP for…

We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for…

This paper is devoted to rejective sampling. We provide an expansion of joint inclusion probabilities of any order in terms of the inclusion probabilities of order one, extending previous results by H\'ajek (1964) and H\'ajek (1981) and…

Talagrand's positivity principle states that one can slightly perturb a Hamiltonian in the Sherrington-Kirkpatrick model in such a way that the overlap of two configurations under the perturbed Gibbs' measure will become typically…

For many years, the intuitions underlying partial-order planning were largely taken for granted. Only in the past few years has there been renewed interest in the fundamental principles underlying this paradigm. In this paper, we present a…