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...
R.E. degrees of continuous functionals.
Recognizable filters and ideals
Reconstructibility of Boolean control networks with time delays in states
This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current...
Recursion in total functionals of finite type
Recursion theoretic operators and morphisms on numbered sets
Recursive Arithmetic of Skolem II.
Recursive expansions
Let A be a recursive structure, and let ψ be a recursive infinitary sentence involving a new relation symbol. The main result of the paper gives syntactical conditions which are necessary and sufficient for every recursive copy of A to have a recursive expansion to a model of ψ, provided A satisfies certain decidability conditions. The decidability conditions involve a notion of rank. The main result is applied to prove some earlier results of Metakides-Nerode and Goncharov. In these applications,...
Recursive inseparability of the sets of identically valid and finitely refutable formulas of some elementary theories of varieties.