<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">465743560</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323111814.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170327e19901201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF01651326</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF01651326</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Dekker</subfield>
   <subfield code="D">J.</subfield>
   <subfield code="u">Rutgers University, 08903, New Brunswick, NJ, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="3">
   <subfield code="a">An isolic generalization of Cauchy's theorem for finite groups</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[J. Dekker]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Summary: 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: (A) Fermat's little theorem, (B) Cauchy's theorem for finite groups, (C) Lucas' theorem for binomial numbers. Letε=(0,1, ...),ℱ 1−1 the family of all one-to-one functions from a subset ofε intoε andℳ 1−1 the family of all p.r. (i.e., partial recursive) one-to-one functions from a subset ofε intoε. A subsetα of ε is finite, ifα is not equivalent to a proper subset under a function inℱ 1−1. The setα is calledisolated, if it is not equivalent to a proper subset under a function inℳ 1−1. An isolated set can also be defined as a subset ofε which has no infinite r.e. (i.e., recursively enumerable) subset. While every finite set is isolated, there are $$c = 2^{\aleph _0 }$$ infinite sets which are isolated; these sets are calledimmune. It is the purpose of this paper to generalize (H) to a principle (H*) for isolated sets and to show how (H*) can be used to prove generalizations of Fermat's little theorem and Cauchy's theorem for finite groups. We have been unable to generalize Lucas' theorem in a similar manner.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 1990</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Archive for Mathematical Logic</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">29/4(1990-12-01), 231-236</subfield>
   <subfield code="x">0933-5846</subfield>
   <subfield code="q">29:4&lt;231</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">29</subfield>
   <subfield code="o">153</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF01651326</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF01651326</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dekker</subfield>
   <subfield code="D">J.</subfield>
   <subfield code="u">Rutgers University, 08903, New Brunswick, NJ, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Archive for Mathematical Logic</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">29/4(1990-12-01), 231-236</subfield>
   <subfield code="x">0933-5846</subfield>
   <subfield code="q">29:4&lt;231</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">29</subfield>
   <subfield code="o">153</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
