22 found
Sort by:
  1. J. C. E. Dekker (1996). Myhill John. Recursive Equivalence Types and Combinatorial Functions. Logic, Methodology and Philosophy of Science, Proceedings of the 1960 International Congress, Edited by Nagel Ernest, Suppes Patrick, and Tarski Alfred, Stanford University Press, Stanford, Calif., 1962, Pp. 46–55. [REVIEW] Journal of Symbolic Logic 31 (3):510-511.
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. J. C. E. Dekker & E. Ellentuck (1992). Myhill's Work in Recursion Theory. Annals of Pure and Applied Logic 56 (1-3):43-71.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. J. C. E. Dekker (1990). An Isolic Generalization of Cauchy's Theorem for Finite Groups. Archive for Mathematical Logic 29 (4):231-236.
    In his note [5] Hausner states a simple combinatorial principle, namely: $$(H)\left\{ {\begin{array}{*{20}c} {if f is a function a non - empty finite set \sigma into itself, p a} \\ {prime, f^p = i_\sigma and \sigma _0 the set of fixed points of f, then } \\ {\left| \sigma \right| \equiv \left| {\sigma _0 } \right|(mod p).} \\\end{array}} \right.$$ .He then shows how this principle can be used to prove:Fermat's little theorem,Cauchy's theorem for finite groups,Lucas' theorem for binomial numbers.Letε=(0,1, ...),ℱ (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. J. C. E. Dekker & E. Ellentuck (1989). Isols and the Pigeonhole Principle. Journal of Symbolic Logic 54 (3):833-846.
    In this paper we generalize the pigeonhole principle by using isols as our fundamental counting tool.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  5. J. C. E. Dekker (1986). Isols and Burnside's Lemma. Annals of Pure and Applied Logic 32:245-263.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. J. C. E. Dekker (1986). The Inclusion-Exclusion Principle for Finitely Many Isolated Sets. Journal of Symbolic Logic 51 (2):435-447.
    A nonnegative interger is called a number, a collection of numbers a set and a collection of sets a class. We write ε for the set of all numbers, o for the empty set, N(α) for the cardinality of $\alpha, \subset$ for inclusion and $\subset_+$ for proper inclusion. Let α, β 1 ,...,β k be subsets of some set ρ. Then α' stands for ρ-α and β 1 ⋯ β k for β 1 ∩ ⋯ ∩ β k . For (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  7. J. C. E. Dekker (1982). Automorphisms of $\Omega$-Octahedral Graphs. Notre Dame Journal of Formal Logic 23 (4):427-434.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. J. C. E. Dekker (1981). Twilight Graphs. Journal of Symbolic Logic 46 (3):539-571.
    This paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite: (a) there is an edge-recognition algorithm, i.e., an effective procedure which enables us, given two distinct vertices, to decide whether they are adjacent, (b) there is a shortest path algorithm, i.e., an effective procedure which enables us, given two distinct vertices, to find a minimal path joining them. A graph $G = \langle\eta, \eta\rangle$ with η as set (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  9. J. C. E. Dekker (1981). Automorphisms of $\Omega$-Cubes. Notre Dame Journal of Formal Logic 22 (2):120-128.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. J. C. E. Dekker (1978). Projective Bigraphs with Recursive Operations. Notre Dame Journal of Formal Logic 19 (2):193-199.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  11. J. C. E. Dekker (1976). Projective Planes of Infinite but Isolic Order. Journal of Symbolic Logic 41 (2):391-404.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. J. C. E. Dekker & E. Ellentuck (1974). Recursion Relative to Regressive Functions. Annals of Mathematical Logic 6 (3-4):231-257.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. J. C. E. Dekker (1971). Countable Vector Spaces with Recursive Operations. Part II. Journal of Symbolic Logic 36 (3):477-493.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  14. J. C. E. Dekker (1971). Two Notes on Vector Spaces with Recursive Operations. Notre Dame Journal of Formal Logic 12 (3):329-334.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  15. C. H. Applebaum & J. C. E. Dekker (1970). Partial Recursive Functions and Ω-Functions. Journal of Symbolic Logic 35 (4):559-568.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. J. C. E. Dekker (1969). Countable Vector Spaces with Recursive Operations. Part I. Journal of Symbolic Logic 34 (3):363-387.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  17. J. C. E. Dekker (1967). Review: Arnold Oberschelp, Ein Satz uber die Unlosbarkeitsgrade der Mengen von Naturlichen Zahlen. [REVIEW] Journal of Symbolic Logic 32 (1):124-124.
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. J. C. E. Dekker (1966). Review: John Myhill, Recursive Equivalence Types and Combinatorial Functions. [REVIEW] Journal of Symbolic Logic 31 (3):510-511.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  19. J. C. E. Dekker (1964). Review: J. P. Cleave, Creative Functions. [REVIEW] Journal of Symbolic Logic 29 (2):102-103.
    Direct download  
     
    My bibliography  
     
    Export citation  
  20. J. C. E. Dekker (1962). Review: Hao Wang, Alternative Proof of a Theorem of Kleene. [REVIEW] Journal of Symbolic Logic 27 (1):81-82.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  21. J. C. E. Dekker (1960). Review: Anil Nerode, Extensions to Isols. [REVIEW] Journal of Symbolic Logic 25 (4):359-361.
    Direct download  
     
    My bibliography  
     
    Export citation  
  22. J. C. E. Dekker (1957). Review: J. Myhill, J. C. Shepherdson, Effective Operations on Partial Recursive Functions. [REVIEW] Journal of Symbolic Logic 22 (3):303-303.
    Direct download  
     
    My bibliography  
     
    Export citation