Search dblp for Publications

export results for "toc:db/journals/apal/apal130.bht:"

 download as .bib file

@article{DBLP:journals/apal/FrickG04,
  author    = {Markus Frick and
               Martin Grohe},
  title     = {The complexity of first-order and monadic second-order logic revisited},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {3--31},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2004.01.007},
  doi       = {10.1016/j.apal.2004.01.007},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/FrickG04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/GodoyTV04,
  author    = {Guillem Godoy and
               Ashish Tiwari and
               Rakesh M. Verma},
  title     = {Deciding confluence of certain term rewriting systems in polynomial
               time},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {33--59},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2004.04.005},
  doi       = {10.1016/j.apal.2004.04.005},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/GodoyTV04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Kreutzer04,
  author    = {Stephan Kreutzer},
  title     = {Expressive equivalence of least and inflationary fixed-point logic},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {61--78},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2004.02.001},
  doi       = {10.1016/j.apal.2004.02.001},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/Kreutzer04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Laurent04,
  author    = {Olivier Laurent},
  title     = {Polarized games},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {79--123},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2004.04.006},
  doi       = {10.1016/j.apal.2004.04.006},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/Laurent04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Ong04,
  author    = {C.{-}H. Luke Ong},
  title     = {An approach to deciding the observational equivalence of Algol-like
               languages},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {125--171},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2003.12.006},
  doi       = {10.1016/j.apal.2003.12.006},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/Ong04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Otto04,
  author    = {Martin Otto},
  title     = {Modal and guarded characterisation theorems over finite transition
               systems},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {173--205},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2004.04.003},
  doi       = {10.1016/j.apal.2004.04.003},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/Otto04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Plotkin04,
  author    = {Gordon D. Plotkin},
  title     = {Foreword},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {1},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2004.05.001},
  doi       = {10.1016/j.apal.2004.05.001},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/Plotkin04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Simpson04,
  author    = {Alex K. Simpson},
  title     = {Computational adequacy for recursive types in models of intuitionistic
               set theory},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {207--275},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2003.12.005},
  doi       = {10.1016/j.apal.2003.12.005},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/Simpson04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/SoltysC04,
  author    = {Michael Soltys and
               Stephen A. Cook},
  title     = {The proof complexity of linear algebra},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {277--323},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2003.10.018},
  doi       = {10.1016/j.apal.2003.10.018},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/SoltysC04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/Statman04,
  author    = {Richard Statman},
  title     = {On the lambda\emph{Y} calculus},
  journal   = {Ann. Pure Appl. Log.},
  volume    = {130},
  number    = {1-3},
  pages     = {325--337},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.apal.2004.04.004},
  doi       = {10.1016/j.apal.2004.04.004},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/apal/Statman04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics