Relational monoids, multirelations, and quantalic recognizers
Relations diophantiennes et la solution négative du 10e problème de Hilbert
Relatively constructible transitive models
Relativizations of the P = NP problem over the complex number field.
Remarks on 1-genericity, semigenericity and related concepts
Remarks on the structure of tt-degrees based on constructive measure theory
Representability of recursive P. Martin-Löf tests
Representable P. Martin-Löf tests
Restricted ideals and the groupability property. Tools for temporal reasoning
In the field of automatic proving, the study of the sets of prime implicants or implicates of a formula has proven to be very important. If we focus on non-classical logics and, in particular, on temporal logics, such study is useful even if it is restricted to the set of unitary implicants/implicates [P. Cordero, M. Enciso, and I. de Guzmán: Structure theorems for closed sets of implicates/implicants in temporal logic. (Lecture Notes in Artificial Intelligence 1695.) Springer–Verlag, Berlin 1999]....
Restrictions on the degree spectra of algebraic structures.
Results on automorphisms of recursively saturated models of PA
Retraceable homogeneous sets
Reversals-space-parallelism tradeoffs for language recognition
Reverse mathematics of some topics from algorithmic graph theory
This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.