Search dblp for Publications

export results for "toc:db/journals/tcs/tcs257.bht:"

 download as .bib file

@article{DBLP:journals/tcs/CegielskiR01,
  author       = {Patrick C{\'{e}}gielski and
                  Denis Richard},
  title        = {Decidability of the theory of the natural integers with the cantor
                  pairing function and the successor},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {51--77},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00109-2},
  doi          = {10.1016/S0304-3975(00)00109-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CegielskiR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Dimitracopoulos01,
  author       = {Costas Dimitracopoulos},
  title        = {On end extensions of models of subsystems of peano arithmetic},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {79--84},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00110-9},
  doi          = {10.1016/S0304-3975(00)00110-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Dimitracopoulos01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DuparcFR01,
  author       = {Jacques Duparc and
                  Olivier Finkel and
                  Jean{-}Pierre Ressayre},
  title        = {Computer science and the fine structure of Borel sets},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {85--105},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00111-0},
  doi          = {10.1016/S0304-3975(00)00111-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DuparcFR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Esbelin01,
  author       = {Henri{-}Alex Esbelin},
  title        = {Counting modulo finite semigroups},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {107--114},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00112-2},
  doi          = {10.1016/S0304-3975(00)00112-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Esbelin01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Korec01,
  author       = {Ivan Korec},
  title        = {A list of arithmetical structures complete with respect to the first-order
                  definability},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {115--151},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00113-4},
  doi          = {10.1016/S0304-3975(00)00113-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Korec01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Margenstern01,
  author       = {Maurice Margenstern},
  title        = {On quasi-unilateral universal Turing machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {153--166},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00114-6},
  doi          = {10.1016/S0304-3975(00)00114-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Margenstern01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Matiyasevich01,
  author       = {Yuri V. Matiyasevich},
  title        = {Some arithmetical restatements of the Four Color Conjecture},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {167--183},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00115-8},
  doi          = {10.1016/S0304-3975(00)00115-8},
  timestamp    = {Sat, 21 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Matiyasevich01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Ressayre01,
  author       = {Jean{-}Pierre Ressayre},
  title        = {Weak Arithmetics},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {1--15},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00106-7},
  doi          = {10.1016/S0304-3975(00)00106-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Ressayre01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Richard01,
  author       = {Denis Richard},
  title        = {What are weak arithmetics?},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {17--29},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00107-9},
  doi          = {10.1016/S0304-3975(00)00107-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Richard01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Sudac01,
  author       = {Olivier Sudac},
  title        = {The prime number theorem is PRA-provable},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {185--239},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00116-X},
  doi          = {10.1016/S0304-3975(00)00116-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Sudac01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Teytaud01,
  author       = {Olivier Teytaud},
  title        = {Decidability of the halting problem for Matiyasevich deterministic
                  machines},
  journal      = {Theor. Comput. Sci.},
  volume       = {257},
  number       = {1-2},
  pages        = {241--251},
  year         = {2001},
  url          = {https://doi.org/10.1016/S0304-3975(00)00117-1},
  doi          = {10.1016/S0304-3975(00)00117-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Teytaud01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.