Algebra i logika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Algebra i logika, 2003, Volume 42, Number 4, Pages 391–412 (Mi al37)  
This article is cited in 1 scientific paper (total in 1 paper)

Constructive and Non-Constructive Infinite Formulas in Computable Structures

P. E. Alaev

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (277 kB) Citations (1)
References:
PDF
HTML
Abstract: A transition from arbitrary $L_{\omega_1\omega}$-formulas to computable formulas in the class of computable structures is considered. It is shown that transition of a certain type is possible which doubles the complexity of the formulas. In addition, the complexity jump is analyzed for the transition from an arbitrary Scott family consisting of $L_{\omega_1\omega}$-formulas to a computable Scott family in a fixed computable structure. Exact estimates of this jump are found.
Keywords: computable structure, computable formula, Scott family.
Received: 27.04.2001
Revised: 01.08.2002
English version:
Algebra and Logic, 2003, Volume 42, Issue 4, Pages 219–231
DOI: https://doi.org/10.1023/A:1025053225562
Bibliographic databases:
UDC: 510.5+510.67
Language: Russian
Citation: P. E. Alaev, “Constructive and Non-Constructive Infinite Formulas in Computable Structures”, Algebra Logika, 42:4 (2003), 391–412; Algebra and Logic, 42:4 (2003), 219–231
Citation in format AMSBIB
\Bibitem{Ala03}
\by P.~E.~Alaev
\paper Constructive and Non-Constructive Infinite Formulas in Computable Structures
\jour Algebra Logika
\yr 2003
\vol 42
\issue 4
\pages 391--412
\mathnet{http://mi.mathnet.ru/al37}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2017511}
\zmath{https://zbmath.org/?q=an:1034.03047}
\transl
\jour Algebra and Logic
\yr 2003
\vol 42
\issue 4
\pages 219--231
\crossref{https://doi.org/10.1023/A:1025053225562}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-42349106964}
Linking options:
  • https://www.mathnet.ru/eng/al37
  • https://www.mathnet.ru/eng/al/v42/i4/p391
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:327
    Full-text PDF :124
    References:40
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024