AbstractBailey, C. and R. Downey, Tabular degrees in \Ga-recursion theory, Annals of Pure and Applied Logic 55 (1992) 205–236.We introduce several generalizations of the truth-table and weak-truth-table reducibilities to \Ga-recursion theory. A number of examples are given of theorems that lift from \Gw-recursion theory, and of theorems that do not. In particular it is shown that the regular sets theorem fails and that not all natural generalizations of wtt are the same
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursiv...
I¡le start an lnvestlgatlon of strong reduclbllltles ln o- and p-recurslon theory. In partlcular, we...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...
AbstractWe show that the elementary theory of the recursively enumerable tt-degrees has the same com...
We consider the weak truth-table reducibility $le_{wtt}$ and we prove the existence of $wtt$-introim...
In this manuscript we explore two topics in recursion theory and their interaction.The first topic i...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
We study the weak truth-table and truth-table degrees of the images of subsets of computable structu...
AbstractAmbos-Spies (1984a) showed that the two basic nondistributive lattices can be embedded in Rp...
We study the weak truth table (wtt) degree spectra of first-order relational structures. We prove a ...
Subrecursive degrees are partitions of computable (recursive) functions generated by strong reducibi...
. We give a decision procedure for the 89-theory of the weak truthtable (wtt) degrees of the recurs...
Massachusetts Institute of Technology. Dept. of Mathematics. Thesis. 1966. Ph.D.Bibliography: leaves...
Abstract We give a decision procedure for the theory of the weak truth table wtt degrees of the re...
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursiv...
I¡le start an lnvestlgatlon of strong reduclbllltles ln o- and p-recurslon theory. In partlcular, we...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...
AbstractWe show that the elementary theory of the recursively enumerable tt-degrees has the same com...
We consider the weak truth-table reducibility $le_{wtt}$ and we prove the existence of $wtt$-introim...
In this manuscript we explore two topics in recursion theory and their interaction.The first topic i...
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, trut...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
We study the weak truth-table and truth-table degrees of the images of subsets of computable structu...
AbstractAmbos-Spies (1984a) showed that the two basic nondistributive lattices can be embedded in Rp...
We study the weak truth table (wtt) degree spectra of first-order relational structures. We prove a ...
Subrecursive degrees are partitions of computable (recursive) functions generated by strong reducibi...
. We give a decision procedure for the 89-theory of the weak truthtable (wtt) degrees of the recurs...
Massachusetts Institute of Technology. Dept. of Mathematics. Thesis. 1966. Ph.D.Bibliography: leaves...
Abstract We give a decision procedure for the theory of the weak truth table wtt degrees of the re...
We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursiv...
I¡le start an lnvestlgatlon of strong reduclbllltles ln o- and p-recurslon theory. In partlcular, we...
AbstractLet A be a recursive structure, and let R be a recursive relation on A. Harizanov (1991) iso...