- On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.details
|
|
Computability theory and differential geometry.Robert I. Soare - 2004 - Bulletin of Symbolic Logic 10 (4):457-486.details
|
|
Step by recursive step: Church's analysis of effective calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.details
|
|
Simple unstable theories.Saharon Shelah - 1980 - Annals of Mathematical Logic 19 (3):177.details
|
|
Simple theories.Byunghan Kim & Anand Pillay - 1997 - Annals of Pure and Applied Logic 88 (2-3):149-164.details
|
|
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.details
|
|
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.details
|
|
[Introduction].Wilfrid Hodges - 1986 - Journal of Symbolic Logic 51 (4):865.details
|
|
[Introduction].Wilfrid Hodges - 1988 - Journal of Symbolic Logic 53 (1):1.details
|
|
Degree spectra and computable dimensions in algebraic structures.Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore & Arkadii M. Slinko - 2002 - Annals of Pure and Applied Logic 115 (1-3):71-113.details
|
|
On the unusual effectiveness of logic in computer science.Joseph Y. Halpern, Robert Harper, Neil Immerman, Phokion G. Kolaitis, Moshe Y. Vardi & Victor Vianu - 2001 - Bulletin of Symbolic Logic 7 (2):213-236.details
|
|
A basis theorem for perfect sets.Marcia J. Groszek & Theodore A. Slaman - 1998 - Bulletin of Symbolic Logic 4 (2):204-209.details
|
|
A borel reducibility theory for classes of countable structures.Harvey Friedman & Lee Stanley - 1989 - Journal of Symbolic Logic 54 (3):894-914.details
|
|
Finite Structures with Few Types.Vera Koponen - 2008 - Bulletin of Symbolic Logic 14 (1):114-116.details
|
|
Quantifier Elimination for Neocompact Sets.H. Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.details
|
|
On founding the theory of algorithms.Yiannis N. Moschovakis - 1998 - In H. G. Dales & Gianluigi Oliveri (eds.), Truth in Mathematics. Oxford University Press, Usa. pp. 71--104.details
|
|
Entscheidungsproblem.A. M. Turing - unknowndetails
|
|
Descriptive Set Theory.Yiannis Nicholas Moschovakis - 1982 - Studia Logica 41 (4):429-430.details
|
|
[Omnibus Review].Akihiro Kanamori - 1981 - Journal of Symbolic Logic 46 (4):864-866.details
|
|
[Omnibus Review].Yiannis N. Moschovakis - 1968 - Journal of Symbolic Logic 33 (3):471-472.details
|
|
Andersson, A., On second-order generalized quanti" ers and" finite structures.D. R. Hirschfeldt, B. Khoussainov, R. A. Shore & A. M. Slinko - 2002 - Annals of Pure and Applied Logic 115:303.details
|
|
[Omnibus Review].Ehud Hrushovski - 1993 - Journal of Symbolic Logic 58 (2):710-713.details
|
|
Finite trees and the necessary use of large cardinals.Harvey Friedman - manuscriptdetails
|
|