6 found
Order:
  1.  13
    A Language and Axioms for Explicit Mathematics.Solomon Feferman, J. N. Crossley, Maurice Boffa, Dirk van Dalen & Kenneth Mcaloon - 1984 - Journal of Symbolic Logic 49 (1):308-311.
  2.  76
    On the Complexity of Models of Arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
    Let P 0 be the subsystem of Peano arithmetic obtained by restricting induction to bounded quantifier formulas. Let M be a countable, nonstandard model of P 0 whose domain we suppose to be the standard integers. Let T be a recursively enumerable extension of Peano arithmetic all of whose existential consequences are satisfied in the standard model. Then there is an initial segment M ' of M which is a model of T such that the complete diagram of M ' (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  3.  7
    On Gödel Incompleteness and Finite Combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (1):23-41.
  4.  26
    Two Further Combinatorial Theorems Equivalent to the 1-Consistency of Peano Arithmetic.Peter Clote & Kenneth Mcaloon - 1983 - Journal of Symbolic Logic 48 (4):1090-1104.
  5. Logic Colloquium '78 Proceedings of the Colloquium Held in Mons, August 1978.Maurice Boffa, D. van Dalen & Kenneth Mcaloon - 1979 - North-Holland Pub. Co. Elsevier North-Holland, Sole Distributors for the U.S.A. And Canada.
     
    Export citation  
     
    Bookmark  
  6.  18
    Annual Meeting of the Association for Symbolic Logic, New York City, December 1987.Nicholas Goodman, Harold T. Hodes, Carl G. Jockusch & Kenneth McAloon - 1988 - Journal of Symbolic Logic 53 (4):1287-1299.