Open Access
2015 Weak Truth Table Degrees of Structures
David R. Belanger
Notre Dame J. Formal Logic 56(2): 263-285 (2015). DOI: 10.1215/00294527-2864298


We study the weak truth table (wtt) degree spectra of first-order relational structures. We prove a dichotomy among the possible wtt degree spectra along the lines of Knight’s upward-closure theorem for Turing degree spectra. We prove new results contrasting the wtt degree spectra of finite- and infinite-signature structures. We show that, as a method of defining classes of reals, the wtt degree spectrum is, except for some trivial cases, strictly more expressive than the Turing degree spectrum.


Download Citation

David R. Belanger. "Weak Truth Table Degrees of Structures." Notre Dame J. Formal Logic 56 (2) 263 - 285, 2015.


Published: 2015
First available in Project Euclid: 17 April 2015

zbMATH: 1334.03041
MathSciNet: MR3337380
Digital Object Identifier: 10.1215/00294527-2864298

Primary: 03D45
Secondary: 03D30

Keywords: degree spectra of structures , weak truth table degrees

Rights: Copyright © 2015 University of Notre Dame

Vol.56 • No. 2 • 2015
Back to Top