Search results for 'Recursion theory Congresses' (try it on Scholar)

1000+ found
Sort by:
  1. Jens Erik Fenstad, R. O. Gandy & Gerald E. Sacks (eds.) (1978). Generalized Recursion Theory Ii: Proceedings of the 1977 Oslo Symposium. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.score: 399.0
    GENERALIZED RECUBION THEORY II © North-Holland Publishing Company (1978) MONOTONE QUANTIFIERS AND ADMISSIBLE SETS Ion Barwise University of Wisconsin ...
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..score: 390.0
    Provability, Computability and Reflection.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  3. Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.score: 224.0
    This work is a sequel to the author's Godel's Incompleteness Theorems, though it can be read independently by anyone familiar with Godel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Piergiorgio Odifreddi (1989). Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers. Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..score: 224.0
    Volume II of Classical Recursion Theory describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, (...)
     
    My bibliography  
     
    Export citation  
  5. Jordan Zashev (2005). Diagonal Fixed Points in Algebraic Recursion Theory. Archive for Mathematical Logic 44 (8):973-994.score: 224.0
    The relation between least and diagonal fixed points is a well known and completely studied question for a large class of partially ordered models of the lambda calculus and combinatory logic. Here we consider this question in the context of algebraic recursion theory, whose close connection with combinatory logic recently become apparent. We find a comparatively simple and rather weak general condition which suffices to prove the equality of least fixed points with canonical (corresponding to those produced by (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.score: 220.0
    The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  7. Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.score: 198.0
    Machine generated contents note: 1. The Computability Concept;2. General Recursive Functions;3. Programs and Machines;4. Recursive Enumerability;5. Connections to Logic;6. Degrees of Unsolvability;7. Polynomial-Time Computability;Appendix: Mathspeak;Appendix: Countability;Appendix: Decadic Notation;.
    Direct download  
     
    My bibliography  
     
    Export citation  
  8. Iraj Kalantari & Larry Welch (2004). A Blend of Methods of Recursion Theory and Topology: A Π1 0 Tree of Shadow Points. [REVIEW] Archive for Mathematical Logic 43 (8):991-1008.score: 198.0
    This paper is a sequel to our [7]. In that paper we constructed a Π1 0 tree of avoidable points. Here we construct a Π1 0 tree of shadow points. This tree is a tree of sharp filters, where a sharp filter is a nested sequence of basic open sets converging to a point. In the construction we assign to each basic open set on the tree an address in 2<ω. One interesting fact is that while our Π1 0 tree (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Anil Nerode & Richard A. Shore (eds.) (1985). Recursion Theory. American Mathematical Society.score: 196.0
    iterations of REA operators, as well as extensions, generalizations and other applications are given in [6] while those for the ...
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. M. M. Arslanov & Steffen Lempp (eds.) (1999). Recursion Theory and Complexity: Proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997. W. De Gruyter.score: 196.0
    No categories
     
    My bibliography  
     
    Export citation  
  11. C.-T. Chong (1984). Techniques of Admissible Recursion Theory. Springer-Verlag.score: 196.0
    No categories
     
    My bibliography  
     
    Export citation  
  12. Jens Erik Fenstad (1980). General Recursion Theory: An Axiomatic Approach. Springer-Verlag.score: 196.0
    No categories
     
    My bibliography  
     
    Export citation  
  13. L. L. Ivanov (1986). Algebraic Recursion Theory. Halsted Press.score: 196.0
    No categories
     
    My bibliography  
     
    Export citation  
  14. Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.score: 196.0
    No categories
     
    My bibliography  
     
    Export citation  
  15. Sy D. Friedman (1983). Some Recent Developments in Higher Recursion Theory. Journal of Symbolic Logic 48 (3):629-642.score: 168.0
    In recent years higher recursion theory has experienced a deep interaction with other areas of logic, particularly set theory (fine structure, forcing, and combinatorics) and infinitary model theory. In this paper we wish to illustrate this interaction by surveying the progress that has been made in two areas: the global theory of the κ-degrees and the study of closure ordinals.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  16. Phokion G. Kolaitis (1985). Canonical Forms and Hierarchies in Generalized Recursion Theory. In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. 42--139.score: 168.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.score: 164.0
    We define, in the spirit of Fenstad [2], a higher type computation theory, and show that countable recursion over the continuous functionals forms such a theory. We also discuss Hyland's proposal from [4] for a scheme with which to supplement S1-S9, and show that this augmented set of schemes fails to generate countable recursion. We make another proposal to which the methods of this section do not apply.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. John N. Crossley (ed.) (1967). Sets, Models and Recursion Theory. Amsterdam, North-Holland Pub. Co..score: 152.0
    No categories
     
    My bibliography  
     
    Export citation  
  19. Robert E. Byerly (1982). Recursion Theory and the Lambda-Calculus. Journal of Symbolic Logic 47 (1):67-83.score: 146.0
    A semantics for the lambda-calculus due to Friedman is used to describe a large and natural class of categorical recursion-theoretic notions. It is shown that if e 1 and e 2 are godel numbers for partial recursive functions in two standard ω-URS's 1 which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e 1 to e 2.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  20. Petr Hájek & Antonín Kučera (1989). On Recursion Theory in I∑. Journal of Symbolic Logic 54 (2):576 - 589.score: 146.0
    It is shown that the low basis theorem is meaningful and provable in I∑ 1 and that the priority-free solution to Post's problem formalizes in this theory.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. Petr Hajek & Antonin Kucera (1989). On Recursion Theory in $Isum_1$. Journal of Symbolic Logic 54 (2):576-589.score: 146.0
    It is shown that the low basis theorem is meaningful and provable in $I\sum_1$ and that the priority-free solution to Post's problem formalizes in this theory.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.score: 144.0
    What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  23. Jeremy Avigad (2002). An Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations. Journal of Mathematical Logic 2 (01):91-112.score: 144.0
    The notion of a function from ℕ to ℕ defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke–Platek admissible set theory with an axiom of infinity. Formalizing the argument provides (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  24. James H. Schmerl (1998). Difference Sets and Recursion Theory. Mathematical Logic Quarterly 44 (4):515-521.score: 144.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.score: 142.0
    A type-structure of partial effective functionals over the natural numbers, based on a canonical enumeration of the partial recursive functions, is developed. These partial functionals, defined by a direct elementary technique, turn out to be the computable elements of the hereditary continuous partial objects; moreover, there is a commutative system of enumerations of any given type by any type below (relative numberings). By this and by results in [1] and [2], the Kleene-Kreisel countable functionals and the hereditary effective operations (HEO) (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  26. Robert E. Byerly (1982). An Invariance Notion in Recursion Theory. Journal of Symbolic Logic 47 (1):48-66.score: 142.0
    A set of godel numbers is invariant if it is closed under automorphisms of (ω, ·), where ω is the set of all godel numbers of partial recursive functions and · is application (i.e., n · m ≃ φ n (m)). The invariant arithmetic sets are investigated, and the invariant recursively enumerable sets and partial recursive functions are partially characterized.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  27. Carl G. Jockusch Jr (1972). Ramsey's Theorem and Recursion Theory. Journal of Symbolic Logic 37 (2):268-280.score: 140.0
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  28. Andrew Arana (2004). Arithmetical Independence Results Using Higher Recursion Theory. Journal of Symbolic Logic 69 (1):1-8.score: 140.0
    We extend an independence result proved in our earlier paper "Solovay's Theorem Cannot Be Simplified" (Annals of Pure and Applied Logic 112 (2001)). Our method uses the Barwise.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  29. Colin G. Bailey (2013). Some Jump-Like Operations in $\Mathbf \Beta $-Recursion Theory. Journal of Symbolic Logic 78 (1):57-71.score: 140.0
    In this paper we show that there are various pseudo-jump operators definable over inadmissible $J_{\beta}$ that relate to the failure of admissiblity and to non-regularity. We will use these ideas to construct some intermediate degrees.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Thomas J. Grilliot (1972). Omitting Types: Application to Recursion Theory. Journal of Symbolic Logic 37 (1):81-89.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  31. Klaus Ambos-Spies (1984). An Extension of the Nondiamond Theorem in Classical and Α-Recursion Theory. Journal of Symbolic Logic 49 (2):586-607.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  32. Robert A. Paola & Alex Heller (1987). Dominical Categories: Recursion Theory Without Elements. Journal of Symbolic Logic 52 (3):594 - 635.score: 140.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  33. Alex Feldman (1992). Recursion Theory in a Lower Semilattice. Journal of Symbolic Logic 57 (3):892-911.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. Robert A. Di Paola & Alex Heller (1987). Dominical Categories: Recursion Theory Without Elements. Journal of Symbolic Logic 52 (3):594-635.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  35. R. G. Downey & Stuart A. Kurtz (1986). Recursion Theory and Ordered Groups. Annals of Pure and Applied Logic 32:137-151.score: 140.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. A. G. Hamilton (1983). Review: G. Metakides, A. Nerode, Recursively Enumerable Vector Spaces; G. Metakides, A. Nerode, Effective Content of Field Theory; G. Metakides, A. Nerode, Recursion Theory on Fields and Abstract Dependence. [REVIEW] Journal of Symbolic Logic 48 (3):880-882.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. G. Metakides & J. B. Remmel (1979). Recursion Theory on Orderings. I. A Model Theoretic Setting. Journal of Symbolic Logic 44 (3):383-402.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  38. Bruce M. Horowitz (1982). Elementary Formal Systems as a Framework for Relative Recursion Theory. Notre Dame Journal of Formal Logic 23 (1):39-52.score: 140.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  39. Douglas Cenzer (1982). Review: Jens E. Fenstad, General Recursion Theory. An Axiomatic Approach. [REVIEW] Journal of Symbolic Logic 47 (3):696-698.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  40. Wolfgang Maass (1978). The Uniform Regular Set Theorem in Α-Recursion Theory. Journal of Symbolic Logic 43 (2):270-279.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. Brian H. Mayoh (1971). Review: Robert I. Soare, Recursion Theory and Dedekind Cuts; Robert I. Soare, Cohesive Sets and Recursively Enumerable Dedekind Cuts. [REVIEW] Journal of Symbolic Logic 36 (1):148-148.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  42. Johan Moldestad & Dag Normann (1976). Models for Recursion Theory. Journal of Symbolic Logic 41 (4):719-729.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. Dag Normann (2000). Review: Arnold Beckmann, Wolfram Pohlers, Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. [REVIEW] Bulletin of Symbolic Logic 6 (2):221-222.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. J. B. Remmel (1980). Recursion Theory on Orderings. II. Journal of Symbolic Logic 45 (2):317-333.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  45. C. E. M. Yates (1975). Review: G. Kreisel, R. O. Gandy, C. E. M. Yates, Some Reasons for Generalizing Recursion Theory. [REVIEW] Journal of Symbolic Logic 40 (2):230-232.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. C. T. Chong (1999). Computability, Enumerability, Unsolvability, Directions in Recursion Theory, Edited by Cooper SB, Slaman TA, and Wainer SS, London Mathematical Society Lecture Note Series, No. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, Vii+ 347 Pp. Harrington Leo and Soare Robert I., Dynamic Properties of Computably Enumerable Sets, Pp. 105–121. Herrmann Eberhard, On the∀∃-Theory of the Factor Lattice by the Major Subset Relation, Pp. 139–166. Lerman Manuel, Embeddings Into ... [REVIEW] Journal of Symbolic Logic 64 (3):1362-1365.score: 140.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  47. C. T. Chong (1983). Hyperhypersimple Supersets in Admissible Recursion Theory. Journal of Symbolic Logic 48 (1):185-192.score: 140.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  48. C. T. Chong (1999). Review: S. B. Cooper, T. A. Slaman, S. S. Wainer, Computability, Enumerability, Unsolvability, Directions in Recursion Theory. [REVIEW] Journal of Symbolic Logic 64 (3):1362-1365.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  49. Peter G. Hinman (1986). Review: Melvin Fitting, Fundamentals of Generalized Recursion Theory. [REVIEW] Journal of Symbolic Logic 51 (4):1078-1079.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  50. Peter G. Hinman (2001). Review: P. G. Odifreddi, Classical Recursion Theory. [REVIEW] Bulletin of Symbolic Logic 7 (1):71-73.score: 140.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000