Presentations of Structures in Admissible Sets
暂无分享,去创建一个
[1] Richard Montague,et al. Recursion Theory as a Branch of Model Theory1 , 1968 .
[2] Julia F. Knight,et al. Generic Copies of Countable Structures , 1989, Ann. Pure Appl. Log..
[3] James H. Schmerl,et al. Decidability and ℵ0-categoricity of theories of partially ordered sets , 1980, Journal of Symbolic Logic.
[4] A. T. Nurtazin,et al. Strong and weak constructivization and computable families , 1974 .
[5] H. Kierstead,et al. DEGREES OF INDISCERNIBLES IN DECIDABLE MODELS , 1985 .
[6] I︠U︡riĭ Leonidovich Ershov. Definability and Computability , 1996 .
[7] Julia F. Knight,et al. Sequences of n-Diagrams , 2002, J. Symb. Log..
[8] A. I. Stukachov. Σ-Definability in Hereditarily Finite Superstructures and Pairs of Models , 2004 .
[9] S. S. Goncharov,et al. The quantity of nonautoequivalent constructivizations , 1977 .
[10] John Chisholm,et al. Effective model theory vs. recursive model theory , 1990, Journal of Symbolic Logic.
[11] I︠U︡riĭ Leonidovich Ershov. Recursive model theory , 1998 .
[12] Yu. L. Ershov. Chapter 5 Σ-Definability of algebraic structures , 1998 .