Related papers: Intuitionistic fixed point theories over Heyting a…

Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We…

The theory of recursive functions is related in a well-known way to the notion of *least fixed points*, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the pure lambda-calculus…

Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference…

A determinantal point process is a stochastic point process that is commonly used to capture negative correlations. It has become increasingly popular in machine learning in recent years. Sampling a determinantal point process however…

The aim of this note is to give simple proofs of some results of Reichstein and Youssin (math.AG/9903162) about the behaviour of fixed points of finite group actions under rational maps. Our proofs work in any characteristic. We also give a…

Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructions (AIC) -- a purely algebraic approach to reasoning about…

This paper provides a canonical construction of a Noetherian least fixed point topology. While such least fixed point are not Noetherian in general, we prove that under a mild assumption, one can use a topological minimal bad sequence…

What is the proper explanation of intuitionistic hypothetical judgment, and thence propositional implication? The answer is unclear from the writings of Brouwer and Heyting, who in their lifetimes propounded multiple (sometimes conflicting)…

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…

In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.

In this paper, we study the fixed point theory for multi-valued mappings on partial cone metric spaces. We prove an analogous to the well-known Kannan$'s$ fixed point theorem and Chatterjea$'s$ fixed point theorem for multi-valued mappings…

We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) that extends intuitionistic logic by least and greatest…

In recent publications in physics and mathematics, concerns have been raised about the use of real numbers to describe quantities in physics, and in particular about the usual assumption that physical quantities are infinitely precise. In…

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…

In this paper, we establish some fixed point theorems in ordered partial metric spaces. An example is given to illustrate our obtained results.

In a 1985 commentary to his collected works, Kolmogorov informed the reader that his 1932 paper 'On the interpretation of intuitionistic logic' "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic…

We consider prediction theory for stationary stochastic processes in continuous time. We discuss prediction using the whole (infinite) past, and using only a finite section of the past. The solutions to both these classical problems have…

We present the logic IBV, which is an intuitionistic version of BV, in the sense that its restriction to the MLL connectives is exactly IMLL, the intuitionistic version of MLL. For this logic we give a deep inference proof system and show…

We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…

Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent…