Pseudo-complements and ordinal logics based on consistency statements

DOI10.2307/2270451zbMATH Open0212.32901OpenAlexW2042751541MaRDI QIDQ5613941

Robert A. Di Paola

Publication date: 1966

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270451

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)

This page was built for publication: Pseudo-complements and ordinal logics based on consistency statements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5613941)