Some properties of algebraic reducibility of constructivizations
type: Item
instance of: scholarly article
title: Some properties of algebraic reducibility of constructivizations
zbMATH Open document ID: 0734.03020
DOI: 10.1007/BF02215287
author: S. T. Fedoryaev
published in: Algebra and Logic
publication date: 1990-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/187539
review text: In the paper under review the author studies the notion of algebraic reducibility of constructivizations. The author introduces for any \(n\in \omega\), \(n>0\), the notion of n-algebraic reducibility of constructivizations (which is the usual algebraic reducibility of constructivizations reduced to relations with n free variables) and studies the relationship between these reducibilities. Further, it is shown that any finite Boolean algebra is the structure of algebraic reducibility for some suitable partially ordered set. Moreover, in some natural sense the class of partially ordered sets is complete.
Mathematics Subject Classification ID: 03C57
zbMATH DE Number: 4213964
zbMATH Keywords: algebraic reducibility of constructivizations
zbMATH Keywords: Boolean algebra
zbMATH Keywords: partially ordered sets
reviewed by: M. M. Arslanov
MaRDI profile type: Publication
cites work: Constructivizable models with a linear structure of algebraic reducibility
OpenAlex ID: W2013377132
description: scientific article; zbMATH DE number 4213964