Paradis terrestre dans l'automate cellulaire de Conway
Parametric inductive definitions and recursive operators over the continuum
Partial conservativity revisited
Partial countable and finite functionals.
Polynomial time bounded truth-table reducibilities to padded sets
We study bounded truth-table reducibilities to sets of small information content called padded (a set is in the class of all -padded sets, if it is a subset of ). This is a continuation of the research of reducibilities to sparse and tally sets that were studied in many previous papers (for a good survey see [HOW1]). We show necessary and sufficient conditions to collapse and separate classes of bounded truth-table reducibilities to padded sets. We prove that depending on two properties of a...
Positive eigenvalues and two-letter generalized words.
Post grammars as a programming language description tool
Postscript to "Built-up systems of fundamental sequences and hierarchies of number-theoretic functions".
Primitive recursive categories and machines
Primitive recursive notations for infinitary formulas
Primitiv-rekursive Funktionen auf Termmengen.
Prioric games and minimal degrees below
Problèmes d 'associativité des monoïdes et problèmes des mots pour les groupes
Proof of the quadratic reciprocity law in primitive recursive arithmetic.
Propositional extensions of [Book]
Propriétés de complexité pour une famille d'algorithmes de Markov
Provident sets and rudimentary set forcing
Using the theory of rudimentary recursion and provident sets expounded in [MB], we give a treatment of set forcing appropriate for working over models of a theory PROVI which may plausibly claim to be the weakest set theory supporting a smooth theory of set forcing, and of which the minimal model is Jensen’s . Much of the development is rudimentary or at worst given by rudimentary recursions with parameter the notion of forcing under consideration. Our development eschews the power set axiom. We...