Switch to: Citations

Add references

You must login to add references.
  1. Logic with Denumerably Long Formulas and Finite Strings of Quantifiers.Dana Scott, J. W. Addison, Leon Henkin & Alfred Tarski - 1971 - Journal of Symbolic Logic 36 (1):157-158.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Деструктивне авторство: Антиавтор і антидар.Semen A. Goncharov - 2018 - Вісник Харківського Національного Університету Імені В. Н. Каразіна. Серія «Філософія. Філософські Перипетії» 58:70-78.
    У статті розглядається питання авторства та його природи у зв’язку з подією Герострата. Проблемною стає ситуація забуття творців храму Артеміди і безсмертна слава його палія. У цьому ключі пропонується концепція деструктивного авторства як форма відображення авторства, заснованого не на звичному акті творення, а на протилежному йому – акті деструкції. При цьому проводиться розмежування деструктивного авторства як реалізації певних атрибутів авторства з використанням деструкції в якості інструмента й можливого його перевороту – авторства деструктивності як феномена, заснованого на автономності та першочерговості деструкції (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Languages with Expressions of InfiniteLength.Carol Ruth Karp - 1964 - North-Holland.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • Categoricity in hyperarithmetical degrees.C. J. Ash - 1987 - Annals of Pure and Applied Logic 34 (1):1-14.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.
    The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with the relatively intrinsically hyperarithmetical sets. As a side effect of the proof an effective version of the Kueker's theorem on definability by means of infinitary formulas is obtained.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • [Omnibus Review].H. Jerome Keisler - 1970 - Journal of Symbolic Logic 35 (2):342-344.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.
    This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, (...)
    Download  
     
    Export citation  
     
    Bookmark   46 citations  
  • A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
    We re-express a previous general result in a way which seems easier to remember, using the terminology of infinite games. We show how this can be applied to construct recursive linear orderings, showing, for example, that if there is a ▵ 0 2β + 1 linear ordering of type τ, then there is a recursive ordering of type ω β · τ.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Intrinsically< i> gs_;< sup> 0< sub> alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Intrinsically gs;0alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
    In many classes of structures, each computable structure has computable dimension 1 or $\omega$. Nevertheless, Goncharov showed that for each $n < \omega$, there exists a computable structure with computable dimension $n$. In this paper we show that, under one natural definition of relativized computable dimension, no computable structure has finite relativized computable dimension greater than 1.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Computably categorical structures and expansions by constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard A. Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Languages with Expressions of Infinite Length.William P. Hanf - 1964 - Journal of Symbolic Logic 33 (3):477-478.
    Download  
     
    Export citation  
     
    Bookmark   44 citations  
  • Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Computably Categorical Structures and Expansions by Constants.Peter Cholak, Sergey Goncharov, Bakhadyr Khoussainov & Richard Shore - 1999 - Journal of Symbolic Logic 64 (1):13-37.
    Download  
     
    Export citation  
     
    Bookmark   10 citations