Related papers: Properties of Selector Proofs
$B$-terms are built from the $B$ combinator alone defined by $B\equiv\lambda fgx. f(g~x)$, which is well known as a function composition operator. This paper investigates an interesting property of $B$-terms, that is, whether repetitive…
This paper investigates the randomness properties of a function of the divisor pairs of a natural number. This function, the antecedents of which go to very ancient times, has randomness properties that can find applications in…
We prove that all algebraic bases $\beta$ allow an eventually periodic representations of the elements of $\mathbb Q(\beta)$ with a finite alphabet of digits $\mathcal A$. Moreover, the classification of bases allowing that those…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence…
The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…
We provide novel simple representations of strategy-proof voting rules when voters have uni-dimensional single-peaked preferences (as well as multi-dimensional separable preferences). The analysis recovers, links and unifies existing…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
Uniform proofs are sequent calculus proofs with the following characteristic: the last step in the derivation of a complex formula at any stage in the proof is always the introduction of the top-level logical symbol of that formula. We…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
Richard Cox [1] set the axiomatic foundations of probable inference and the algebra of propositions. He showed that consistency within these axioms requires certain rules for updating belief. In this paper we use the analogy between…
In this article, we review selective inference, a set of techniques for inference when the statistical question asked is a function of the data. This setting often arises in contemporary scientific workflows, where hypotheses and parameters…
Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…
Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of…
The characteristic sequence of hypergraphs $<P_n : n<\omega>$ associated to a formula $\phi(x;y)$, introduced in [arXiv:0908.4111], is defined by $P_n(y_1,... y_n) = (\exists x) \bigwedge_{i\leq n} \phi(x;y_i)$. This paper continues the…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…