BibTeX records: E. A. Cichon

download as .bib file

@article{DBLP:journals/apal/CichonB01,
  author    = {E. A. Cichon and
               Elias Tahhan{-}Bittar},
  title     = {Strictly orthogonal left linear rewrite systems and primitive recursion},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {108},
  number    = {1-3},
  pages     = {79--101},
  year      = {2001},
  url       = {https://doi.org/10.1016/S0168-0072(00)00041-5},
  doi       = {10.1016/S0168-0072(00)00041-5},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/CichonB01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-PL-0010008,
  author    = {E. A. Cichon and
               Jean{-}Yves Marion},
  title     = {The Light Lexicographic path Ordering},
  journal   = {CoRR},
  volume    = {cs.PL/0010008},
  year      = {2000},
  url       = {https://arxiv.org/abs/cs/0010008},
  timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/cs-PL-0010008.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CichonB98,
  author    = {E. A. Cichon and
               Elias Tahhan{-}Bittar},
  title     = {Ordinal Recursive Bounds for Higman's Theorem},
  journal   = {Theor. Comput. Sci.},
  volume    = {201},
  number    = {1-2},
  pages     = {63--84},
  year      = {1998},
  url       = {https://doi.org/10.1016/S0304-3975(97)00009-1},
  doi       = {10.1016/S0304-3975(97)00009-1},
  timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/tcs/CichonB98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/CichonW97,
  author    = {E. A. Cichon and
               Andreas Weiermann},
  title     = {Term Rewriting Theory for the Primitive Recursive Functions},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {83},
  number    = {3},
  pages     = {199--223},
  year      = {1997},
  url       = {https://doi.org/10.1016/S0168-0072(96)00015-2},
  doi       = {10.1016/S0168-0072(96)00015-2},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/CichonW97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caap/CichonT96,
  author    = {E. A. Cichon and
               H{\'{e}}l{\`{e}}ne Touzet},
  editor    = {H{\'{e}}l{\`{e}}ne Kirchner},
  title     = {An Ordinal Calculus for Proving Termination in Term Rewriting},
  booktitle = {Trees in Algebra and Programming - CAAP'96, 21st International Colloquium,
               Link{\"{o}}ping, Sweden, April, 22-24, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1059},
  pages     = {226--240},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-61064-2\_40},
  doi       = {10.1007/3-540-61064-2\_40},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/caap/CichonT96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/CichonW83,
  author    = {E. A. Cichon and
               Stanley S. Wainer},
  title     = {The Slow-Growing and the Grzecorczyk Hierarchies},
  journal   = {J. Symb. Log.},
  volume    = {48},
  number    = {2},
  pages     = {399--408},
  year      = {1983},
  url       = {https://doi.org/10.2307/2273557},
  doi       = {10.2307/2273557},
  timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jsyml/CichonW83.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics