39 found
Order:
Disambiguations
John N. Crossley [38]John Newsome Crossley [1]
  1.  5
    Problems in the Philosophy of Mathematics.John N. Crossley - 1968 - Philosophical Quarterly 18 (72):275-275.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  2.  71
    What is Mathematical Logic?John N. Crossley (ed.) - 1972 - Dover Publications.
    This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  3.  15
    [Omnibus Review].John N. Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.
    Reviewed Works:Andrew Hodges, Rolf Herken, Alan Turing and the Turing Machine.Stephen C. Kleene, Turing's Analysis of Computability, and Major Applications of it.Robin Gandy, The Confluence of Ideas in 1936.Solomon Feferman, Turing in the Land of O.Martin Davis, Esther R. Phillips, Mathematical Logic and the Origin of Modern Computers.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  4.  18
    Recursive Categoricity and Recursive Stability.John N. Crossley, Alfred B. Manaster & Michael F. Moses - 1986 - Annals of Pure and Applied Logic 31:191-204.
  5.  10
    Recursively Enumerable Degrees and the Degrees Less Than 0.C. E. M. Yates & John N. Crossley - 1970 - Journal of Symbolic Logic 35 (4):589-589.
  6.  39
    Constructive Order Types, II.John N. Crossley - 1966 - Journal of Symbolic Logic 31 (4):525-538.
  7.  44
    The Given.John N. Crossley - 1982 - Studia Logica 41 (2-3):131 - 139.
    The paper presents a brief survey of recent work by Metakides, Nerode and others in the area of effective algebra and makes some comments on the relation between formal presentations, characterizations, etc. of sets and of algebraic structures and their practical presentations.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  11
    Formal Logic.John N. Crossley, Paul Lorenzen & Frederick J. Crosson - 1967 - Philosophical Quarterly 17 (66):83.
  9.  5
    Computable Functionals of Finite Type I.R. O. Gandy & John N. Crossley - 1970 - Journal of Symbolic Logic 35 (1):157-158.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Constructive Order Types, III.P. H. G. Aczel & John N. Crossley - 1966 - Archive for Mathematical Logic 9 (3-4):112-116.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  54
    Curry-Howard Terms for Linear Logic.Frank A. Bäuerle, David Albrecht, John N. Crossley & John S. Jeavons - 1998 - Studia Logica 61 (2):223-235.
    In this paper we 1. provide a natural deduction system for full first-order linear logic, 2. introduce Curry-Howard-style terms for this version of linear logic, 3. extend the notion of substitution of Curry-Howard terms for term variables, 4. define the reduction rules for the Curry-Howard terms and 5. outline a proof of the strong normalization for the full system of linear logic using a development of Girard's candidates for reducibility, thereby providing an alternative to Girard's proof using proof-nets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  12. Algebra and Logic: Papers From the 1974 Summer Research Institute of the Australian Mathematical Society, Monash University, Australia.John N. Crossley (ed.) - 1975 - Springer Verlag.
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  23
    Alfred B. Manaster. Rich Co-Ordinals, Addition Isomorphisms, and RETs. The Journal of Symbolic Logic, Vol. 34 , Pp. 45–52.John N. Crossley - 1971 - Journal of Symbolic Logic 36 (2):342.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  17
    Andrew Hodges. Alan Turing and the Turing Machine. The Universal Turing Machine, A Half-Century Survey, Edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. Pp. 3–15. - Stephen C. Kleene. Turing's Analysis of Computahility, and Major Applications of It. The Universal Turing Machine, A Half-Century Survey, Edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. Pp. 17–54. - Robin Gandy. The Confluence of Ideas in 1936. The Universal Turing Machine, A Half-Century Survey, Edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. Pp. 55–111. - Solomon Feferman. Turing in the Land of O. The Universal Turing Machine, A Half-Century Survey, Edited by Rolf Herken, Kammerer & Unverzagt, Hamburg and Berlin, and Oxford University Press, Oxford and New York, 1988. Pp. 113–147. - Martin Davis. Mathematica. [REVIEW]John N. Crossley - 1991 - Journal of Symbolic Logic 56 (3):1089-1090.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  15
    Alan Turing and the Turing Machine.Turing's Analysis of Computability, and Major Applications of It.The Confluence of Ideas in 1936.Turing in the Land of O.Mathematical Logic and the Origin of Modern Computers. [REVIEW]John N. Crossley, Andrew Hodges, Rolf Herken, Stephen C. Kleene, Robin Gandy, Solomon Feferman, Martin Davis & Esther R. Phillips - 1991 - Journal of Symbolic Logic 56 (3):1089.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  5
    Cancellation Laws for Polynomial-Time P-Isolated Sets.John N. Crossley & J. B. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):147-172.
    A universal Horn sentence in the language of polynomial-time computable combinatorial functions of natural numbers is true for the natural numbers if, and only if, it is true for PETs of p-time p-isolated sets with functions induced by fully p-time combinatorial operators.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  17.  22
    Campanus of Novara and Euclid's "Elements". H. L. L. Busard.John N. Crossley - 2008 - Speculum 83 (1):181-182.
  18. Constructive Order Types.John N. Crossley - 1969 - London: North-Holland Pub. Co..
     
    Export citation  
     
    Bookmark  
  19.  4
    Completeness Proofs for Propositional Logic with Polynomial-Time Connectives.John N. Crossley & Philip J. Scott - 1989 - Annals of Pure and Applied Logic 44 (1-2):39-52.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20. Formal Systems and Recursive Functions.John N. Crossley & Michael A. E. Dummett (eds.) - 1965 - Amsterdam: North-Holland Pub. Co..
     
    Export citation  
     
    Bookmark  
  21. Formal Systems and Recursive Functions. Proceedings of the Eighth Logic Colloquium Oxford, July 1963.John N. Crossley & Michael A. E. Dummett (eds.) - 1965 - North-Holland.
    No categories
     
    Export citation  
     
    Bookmark  
  22. KreisePs Effectiveness.John N. Crossley - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana. About and Around Georg Kreisel. A K Peters. pp. 33.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  23.  12
    Les mathématiques infinitésimales du IXe au XIe siècle, 4: Ibn al-Haytham, méthodes géométriques, transformations ponctuelles et philosophie des mathématiques. Roshdi Rashed.John N. Crossley - 2005 - Speculum 80 (3):955-957.
    No categories
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  24.  55
    Meeting of the Association for Symbolic Logic: Melbourne, Australia 1979.John N. Crossley & Lloyd Humberstone - 1981 - Journal of Symbolic Logic 46 (2):424-426.
  25.  1
    Non-Uniqueness at Ω 2 in Kleene's O.John N. Crossley - 1970 - Journal of Symbolic Logic 35 (2):336-336.
    Direct download  
     
    Export citation  
     
    Bookmark  
  26. Non-Uniqueness at Ω2 in Kleene'sO.John N. Crossley & Kurt Schütte - 1966 - Archive for Mathematical Logic 9 (3-4):95-101.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  3
    Review: Dirk van Dalen, Algorithms and Decision Problems: A Crash Course in Recursion Theory. [REVIEW]John N. Crossley - 1989 - Journal of Symbolic Logic 54 (3):1094-1095.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  3
    Recursive Equivalence: A Survey.John N. Crossley - 1972 - Journal of Symbolic Logic 37 (2):406-407.
  29.  33
    Review: Eckart Menzler-Trott’s — Logic’s Lost Genius: The Life of Gerhard Gentzen. [REVIEW]John N. Crossley - 2008 - Australasian Journal of Logic 6:83-86.
    Review of Eckart Menzler-Trott’s book, Logic’s Lost Genius: The Life of Gerhard Gentzen.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  23
    Review of Indian Philosophy and Philosophy of Science, by Sundar Sarukkai. [REVIEW]John N. Crossley - 2009 - Philosophy East and West 59 (4):565-567.
  31. Sets, Models and Recursion Theory.John N. Crossley (ed.) - 1967 - Amsterdam: North-Holland Pub. Co..
     
    Export citation  
     
    Bookmark  
  32. Sets, Models and Recursion Theory Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965.John N. Crossley & Logic Colloquium - 1967 - North-Holland.
     
    Export citation  
     
    Bookmark  
  33.  9
    Van Dalen Dirk. Algorithms and Decision Problems: A Crash Course in Recursion Theory. Handbook of Philosophica Logic, Volume I, Elements of Classical Logic, Edited by Gabbay D. And Guenthner F., Synthese Library, Vol. 164, D. Reidel Publishing Company, Dordrecht, Boston, and Lancaster, 1983, Pp. 409–478. [REVIEW]John N. Crossley - 1989 - Journal of Symbolic Logic 54 (3):1094-1095.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34.  13
    Logics Modulo Theories: A Logical Framework for Multi-Agent Systems.Lito Perez Cruz & John Newsome Crossley - 2015 - Logic Journal of the IGPL 23 (4):553-583.
  35.  26
    Handbook of Recursive Mathematics, Volume 2, Recursive Algebra, Analysis and Combinatorics.John N. Crossley - 2001 - Bulletin of Symbolic Logic 7 (1):69-71.
  36. Table Des Matieres du Vol. 137-138.Dominic Hyde, Rehabilitating Russell, John S. Jeavons & John N. Crossley - 1992 - Logique Et Analyse 35:206.
  37. A Logic-Based Modelling of Prolog Resolution Sequences.John S. Jeavons & John N. Crossley - 1992 - Logique Et Analyse 35 (138):189-205.
     
    Export citation  
     
    Bookmark  
  38.  10
    Concrete Models of Set Theory.R. B. Jensen & John N. Crossley - 1970 - Journal of Symbolic Logic 35 (3):472-473.
    Direct download  
     
    Export citation  
     
    Bookmark  
  39. First-Order Functional Calculus.John N. Crossley - 1965 - Philosophical Quarterly 15 (61):370-371.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark