Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T16:03:35.441Z Has data issue: false hasContentIssue false

FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS

Published online by Cambridge University Press:  01 December 2016

RUSSELL MILLER
Affiliation:
DEPARTMENT OF MATHEMATICS QUEENS COLLEGE – C.U.N.Y. 65-30 KISSENA BLVD. FLUSHING, NEW YORK, NY 11367, USAPH.D. PROGRAMS IN MATHEMATICS & COMPUTER SCIENCE C.U.N.Y. GRADUATE CENTER 365 FIFTH AVENUE NEW YORK, NY 10016, USA E-mail: russell.miller@qc.cuny.edu Webpage: qcpages.qc.cuny.edu/∼rmiller
KENG MENG NG
Affiliation:
DEPARTMENT OF MATHEMATICS NANYANG TECHNOLOGICAL UNIVERSITY SINGAPORE E-mail: kmng@ntu.edu.sg Webpage: www.ntu.edu.sg/home/kmng/
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We introduce the notion of finitary computable reducibility on equivalence relations on the domain ω. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular, whereas no equivalence relation can be ${\rm{\Pi }}_{n + 2}^0$ -complete under computable reducibility, we show that, for every n, there does exist a natural equivalence relation which is ${\rm{\Pi }}_{n + 2}^0$ -complete under finitary reducibility. We also show that our hierarchy of finitary reducibilities does not collapse, and illustrate how it sharpens certain known results. Along the way, we present several new results which use computable reducibility to establish the complexity of various naturally defined equivalence relations in the arithmetical hierarchy.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2016