Barwise: Infinitary logic and admissible sets

Bulletin of Symbolic Logic

Volumn 10, Issue 1, 2004, Pages 4-36

  Keisler, H Jerome ^a   Knight, Julia F ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF NOTRE DAME   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1842579142     PISSN: 10798986     EISSN: None     Source Type: Journal    
DOI: 10.2178/bsl/1080330272     Document Type: Article

References (67)

1. A. Adamson, Admissible sets and the saturation of structures, Queen’s Mathematical Preprint, no. 1977—4, 1977.
2. A. Arana, Ph.D. thesis, University of Notre Dame, 2003.
3. C. J. Ash and J. F. Knight, Computable structures and the hyperarithmeticalhierarchy, Elsevier, 2000.
4. K. J. Barwise, Infinitary logic and admissible sets, Ph.D. thesis, Stanford University, 1967.
5. K. J. Barwise, Implicit definability and compactness in infinitary languages, The syntax and semantics of infinitary languages (K. J. Barwise, editor), Springer-Verlag, 1968, pp. 1-35.
6. K. J. Barwise, Applications of strict nj predicates to infinitary logic, The Journal of Symbolic Logic, vol. 34 (1969), pp. 409-432.
7. K. J. Barwise, Infinitary logic and admissible sets, The Journal of Symbolic Logic, vol. 34 (1969), pp. 226-252.
8. K. J. Barwise, Infinitary methods in the model theory of set theory, Logic colloquium’69 (R. O. Gandy and C. M. Yates, editors), 1969, pp. 63-66.
9. K. J. Barwise, The hanf number of second order logic, The Journal of Symbolic Logic, vol. 37 (1972), pp. 588-594.
10. K. J. Barwise, Back andforth through infinitary logic, Studies in model theory (M. D. Morley, editor), Mathematical Association of America, 1973, pp. 5-34.
11. K. J. Barwise, Admissible sets and the interaction of model theory, recursion theory, and set theory, Proceedings of the international congress of mathematicians (J. E. Fenstad and P. G. Hinman, editors), vol. 2, 1974, pp. 229-234.
12. K. J. Barwise, Admissible sets over models of set theory, Generalized recursion theory (J. E. Fenstad and P. G. Hinman, editors), North-Holland, 1974, pp. 97-122.
13. K. J. Barwise, Admissible sets and structures, Springer-Yerlag, 1975.
14. K. J. Barwise, On Moschovakis’ closure ordinals, The Journal of Symbolic Logic, vol. 42 (1977), pp. 292-298.
15. K. J. Barwise, Monotone quantifiers and admissible sets, Generalized recursion theory II (J. E. Fenstad, R. O. Gandy, and G. E. Sacks, editors), North-Holland, 1978, pp. 1-38.
16. K. J. Barwise, The right things for the right reasons, Kreiseliana: About and around Georg Kreisel (P. Odifreddi, editor), Peters, 1996, pp. 15-23.
17. K. J. Barwise and P. C. Eklof, Lefschetz's principle, Journal of Algebra, vol. 13 (1969), pp. 554-570.
18. K. J. Barwise and P. C. Eklof, Infinitary properties of Abelian torsion groups, Annals ofMathematical Logic, vol. 2 (1970), pp. 25-68.
19. K. J. Barwise, R. O. Gandy, and Y. N. Moschovakis, The next admissible set, The Journal of Symbolic Logic, vol. 36 (1971), pp. 108-120.
20. K. J. Barwise, M. KauFMAnn, and M. MakKai, Stationary logic, Annals of Mathematical Logic, vol. 13 (1978), pp. 171-224.
21. K. J. Barwise and K. Kunen, Hanf numbers for fragments of, Israel Journal of Mathematics, vol. 10 (1971), pp. 306-320.
22. K. J. Barwise and Y. N. Moschovakis, Global inductive definability, The Journal of Symbolic Logic, vol. 43 (1978), pp. 521-534.
23. K. J. Barwise and J. S. Schupf, On recursively saturated models of arithmetic, Model theory and algebra (D. H. Saracino and V. B. Weispfenning, editors), Springer-Verlag, 1973, pp. 42-55.
24. K. J. Barwise and J. S. Schupf, An introduction to recursively saturated and resplendent models, The Journal of Symbolic Logic, vol. 41 (1976), pp. 531-536.
25. K. J. Barwise and J. van BentHam, Interpolation, preservation, and pebble games, The Journal of Symbolic Logic, vol. 64 (1999), pp. 881-903.
26. C. C. Chang, Some remarks on the model theory of infinitary languages, The syntax and semantics of infinitary languages (K. J. Barwise, editor), Springer-Verlag, 1968, pp. 36-63.
27. C. C. Chang and H. J. Keisler, Model theory, third ed., North-Holland, 1990.
28. S. Feferman and G. Kreisel, Persistent and invariant formulas relative to theories of higher order, Bulletin of the American Mathematical Society, vol. 72 (1966), pp. 480-485.
29. H. Friedman and R. Jensen, Note on admissible ordinals, The syntax and semantics of infinitary languages (K. J. Barwise, editor), Springer-Verlag, 1968, pp. 77-79.
30. W. Hanf, Incompactness in languages with infinitely long expressions, Fundamenta Mathematicae, vol. 53 (1964), pp. 309-324.
31. J. Harrison, Recursive pseudo well-orderings, Ph.D. thesis, Stanford University, 1966.
32. J. Harrison, Recursive pseudo well-orderings, Transactions of the American Mathematical Society, vol. 131 (1968), pp. 526-543.
33. L. Helia, P. G. Koiams, and K. Luosto, Almost everywhere equivalence of logics in finite model theory, this Bulletin, vol. 12 (1996), pp. 422-443.
34. L. Henkin, The completeness of the first-order predicate calculus, The Journal of Symbolic Logic, vol. 14 (1949), pp. 159-166.
35. L. Henkin, A generalization of the concept of co-consistency, The Journal of Symbolic Logic, vol. 19 (1954), pp. 183-196.
36. L. Henkin, A generalization of the concept of co-completeness, The Journal of Symbolic Logic, vol. 22 (1957), pp. 1-14.
37. C. KArp, Languages with expressions of infinite length, Ph.D. thesis, University of Southern California, 1959.
38. H. J. Keisler, Model theory for infinitary logic, North-Holland, 1971.
39. S. C. Kleene, On the forms of the predicates in the theory of constructive ordinals, II, American Journal of Mathematics, vol. 77 (1955), pp. 405-428.
40. G. Kreisel, Set-theoretic problems suggested by the notion ofpotential totality, Infini-tistic methods, Pergamon, 1961, pp. 103-140.
41. G. Kreisel and G. SAcks, Metarecursive sets, The Journal ofSymbolic Logic, vol. 30 (1965), pp. 318-338.
42. S. Kripke, Transfinite recursions on admissible ordinals, I and II, The Journal of Symbolic Logic, vol. 29 (1964), pp. 161-162.
43. S. Lempp and M. LermAn, A generalframework for priority arguments, this Bulletin, vol. 1 (1995), pp. 189-201.
44. A. Levy, A hierarchy offormulas in set theory, Memoirs of the Americal Mathematical Society, vol. 57, American Mathematical Society, 1965.
45. L. Lipschitz and M. Nadel, The additive structure of models of arithmetic, Proceedings of the American Mathematical Society, vol. 68 (1978), pp. 331-336.
46. E. K. Lopez-Escobar, Infinitely long formulas with countable quantifier degrees, Ph.D. thesis, University of California, Berkeley, 1964.
47. E. K. Lopez-Escobar, An interpolation theorem for denumerably long sentences, Fundamenta Math-ematicae, vol. 57 (1965), pp. 253-272.
48. E. K. Lopez-Escobar, On definable well-orderings, Fundamenta Mathematicae, vol. 59 (1966), pp. 13-21 and 299-300.
49. M. Makkai, An application of a method of Smullyan to logics on admissible sets, Bulletin of the Polish Academy of Sciences, vol. 17 (1969), pp. 341-346.
50. M. Makkai, An example concerning Scott heights, The Journal of Symbolic Logic, vol. 46 (1981), pp. 301-318.
51. M. Morley, Omitting classes of elements, The theory of models (J. Addison, L. Henkin, and A. Tarski, editors), North-Holland, 1965, pp. 263-273.
52. M. Morley, The Hanf number for co-logic (abstract), The Journal of Symbolic Logic, vol. 32 (1967), p. 437.
53. A. S. Morozov, Functional trees and automorphisms of models, Algebra and Logic, vol. 32 (1993), pp. 28-38.
54. Y. N. Moschovakis, Elementary induction on abstract structures, North-Holland, 1974.
55. M. E. Nadel, Scott sentences for admissible sets, Annals ofMathematical Logic, vol. 7 (1974), pp. 267-294.
56. M. E. Nadel, admissible fragments, Model-theoretic logics (K. J. Barwise and S. Feferman, editors), Springer-Verlag, 1985, pp. 271-316.
57. S. Orey, On œ-consistency and related properties, The Journal of Symbolic Logic, vol. 21 (1956), pp. 246-252.
58. R. PlAtek, Foundations of recursion theory, Ph.D. thesis, Stanford University, 1966.
59. J.-P. Ressayre, Models with compactness properties relative to an admissible language, Annals of Mathematical Logic, vol. 11 (1977), pp. 31-55.
60. H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill, 1967.
61. G. E. Sacks, Metarecrusively enumerable sets and admissible ordinals, Bulletin of the American Mathematical Society, vol. 72 (1966), pp. 59-64.
62. J. Schlipf, A guide to the identification of admissible sets above structures, Annals of Mathematical Logic, vol. 12 (1977), pp. 151-192.
63. J. Schlipf, Model theory and recursive saturation, The Journal of Symbolic Logic, vol. 43 (1978), pp. 183-206.
64. D. Scott, Logic with denumerably long formulas and finite strings of quantifiers, The theory of models (J. Addison, L. Henkin, and A. Tarski, editors), North-Holland, 1965, pp. 329-341.
65. G. Takeuti, Recursive functions and arithmetical functions of ordinal numbers, Logic, methodology and philosophy of science (Y. Bar-Hillel, editor), North-Holland, 1965, pp. 179196.
66. T. Tugue, On the partial recursive functions ofordinal numbers, Journal ofthe Mathematical Society of Japan, vol. 16 (1964), pp. 1-31.
67. R. Vaught, Denumerable models of complete theories, Infinitistic methods, Pergamon, 1961, pp. 303-321.