Recursive versus recursively enumerable binary relations
type: Item
instance of: scholarly article
title: Recursive versus recursively enumerable binary relations
zbMATH Open document ID: 0796.03050
DOI: 10.1007/BF01053261
author: Dev K. Roy
published in: Studia Logica
publication date: 1994-04-12T00:00:00Z
Mathematics Subject Classification ID: 03D45
zbMATH DE Number: 549799
zbMATH Keywords: antisymmetry
zbMATH Keywords: linearity
zbMATH Keywords: recursively enumerable binary relation
zbMATH Keywords: recursively isomorphic
zbMATH Keywords: recursive relation
MaRDI profile type: Publication
cites work: Some undecidability results for lattices in recursion theory
cites work: tt- and m-degrees
cites work: Two-dimensional partial orderings: Recursive model theory
cites work: Q3690803
cites work: Strong reducibilities
cites work: Q5573961
cites work: R. e. presented linear orders
cites work: Effective extensions of partial orders
cites work: Q3819052
full work available at URL: https://doi.org/10.1007/bf01053261
OpenAlex ID: W1989224212
description: scientific article; zbMATH DE number 549799