Standard

On computability-theoretic universality of Boolean-valued models. / Bazhenov, Nikolay; Mustafa, Manat.

In: Journal of Computer and System Sciences, Vol. 161, 103821, 11.2026.

Research output: Contribution to journal › Article › peer-review

Harvard

Bazhenov, N & Mustafa, M 2026, 'On computability-theoretic universality of Boolean-valued models', Journal of Computer and System Sciences, vol. 161, 103821. https://doi.org/10.1016/j.jcss.2026.103821

APA

Bazhenov, N., & Mustafa, M. (2026). On computability-theoretic universality of Boolean-valued models. Journal of Computer and System Sciences, 161, [103821]. https://doi.org/10.1016/j.jcss.2026.103821

Vancouver

Bazhenov N, Mustafa M. On computability-theoretic universality of Boolean-valued models. Journal of Computer and System Sciences. 2026 Nov;161:103821. doi: 10.1016/j.jcss.2026.103821

Author

Bazhenov, Nikolay ; Mustafa, Manat. / On computability-theoretic universality of Boolean-valued models. In: Journal of Computer and System Sciences. 2026 ; Vol. 161.

BibTeX

@article{af982e1ef66c40958eefe337e7f2acfa,
title = "On computability-theoretic universality of Boolean-valued models",
abstract = "The paper develops a computability-theoretic approach to effective presentations of Boolean-valued models A. The introduced notion of an effective presentation for A is a natural extension of the classical notion of a decidable structure. We prove that (within the developed approach) the class of Boolean-valued models is universal with respect to degree spectra of structures and effective dimensions. We also show that the theory of the class of Boolean-valued models is hereditarily undecidable.",
keywords = "Boolean-valued model, Computable dimension, Computable structure, Decidable structure, Degree spectrum, Undecidability",
author = "Nikolay Bazhenov and Manat Mustafa",
year = "2026",
month = nov,
doi = "10.1016/j.jcss.2026.103821",
language = "English",
volume = "161",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Elsevier Science Publishing Company, Inc.",

}

RIS

TY - JOUR

T1 - On computability-theoretic universality of Boolean-valued models

AU - Bazhenov, Nikolay

AU - Mustafa, Manat

PY - 2026/11

Y1 - 2026/11

N2 - The paper develops a computability-theoretic approach to effective presentations of Boolean-valued models A. The introduced notion of an effective presentation for A is a natural extension of the classical notion of a decidable structure. We prove that (within the developed approach) the class of Boolean-valued models is universal with respect to degree spectra of structures and effective dimensions. We also show that the theory of the class of Boolean-valued models is hereditarily undecidable.

AB - The paper develops a computability-theoretic approach to effective presentations of Boolean-valued models A. The introduced notion of an effective presentation for A is a natural extension of the classical notion of a decidable structure. We prove that (within the developed approach) the class of Boolean-valued models is universal with respect to degree spectra of structures and effective dimensions. We also show that the theory of the class of Boolean-valued models is hereditarily undecidable.

KW - Boolean-valued model

KW - Computable dimension

KW - Computable structure

KW - Decidable structure

KW - Degree spectrum

KW - Undecidability

UR - https://www.scopus.com/pages/publications/105040689368

UR - https://www.mendeley.com/catalogue/8f556acf-2cb5-3a89-b3c8-2b1b0b5e2498/

U2 - 10.1016/j.jcss.2026.103821

DO - 10.1016/j.jcss.2026.103821

M3 - Article

VL - 161

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

M1 - 103821

ER -

ID: 79924127