Разрешимость теории некоторой фактор-решетки рекурсивно-перечислимых множеств.

А.Н. Дегтев

Algebra i Logika (1978)

  • Volume: 17, Issue: 2, page 134-143
  • ISSN: 0373-9252

How to cite

top

Дегтев, А.Н.. "Разрешимость $\forall \exists $ теории некоторой фактор-решетки рекурсивно-перечислимых множеств.." Algebra i Logika 17.2 (1978): 134-143. <http://eudml.org/doc/187003>.

@article{Дегтев1978,
author = {Дегтев, А.Н.},
journal = {Algebra i Logika},
keywords = {quotient lattice; solvability; immune sets; lattice of recursively enumerable sets},
language = {rus},
number = {2},
pages = {134-143},
publisher = {Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki},
title = {Разрешимость $\forall \exists $ теории некоторой фактор-решетки рекурсивно-перечислимых множеств.},
url = {http://eudml.org/doc/187003},
volume = {17},
year = {1978},
}

TY - JOUR
AU - Дегтев, А.Н.
TI - Разрешимость $\forall \exists $ теории некоторой фактор-решетки рекурсивно-перечислимых множеств.
JO - Algebra i Logika
PY - 1978
PB - Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki
VL - 17
IS - 2
SP - 134
EP - 143
LA - rus
KW - quotient lattice; solvability; immune sets; lattice of recursively enumerable sets
UR - http://eudml.org/doc/187003
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.