Search dblp for Publications

• > Home > Search

@inproceedings{DBLP:journals/corr/Bruse16,
  author       = {Florian Bruse},
  editor       = {Domenico Cantone and
                  Giorgio Delzanno},
  title        = {Alternation Is Strict For Higher-Order Modal Fixpoint Logic},
  booktitle    = {Proceedings of the Seventh International Symposium on Games, Automata,
                  Logics and Formal Verification, GandALF 2016, Catania, Italy, 14-16
                  September 2016},
  series       = {{EPTCS}},
  volume       = {226},
  pages        = {105--119},
  year         = {2016},
  url          = {https://doi.org/10.4204/EPTCS.226.8},
  doi          = {10.4204/EPTCS.226.8},
  timestamp    = {Wed, 12 Sep 2018 01:05:14 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Bruse16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-0907-0616,
  author       = {Philipp Weis and
                  Neil Immerman},
  title        = {Structure Theorem and Strict Alternation Hierarchy for {FO2} on Words},
  journal      = {Log. Methods Comput. Sci.},
  volume       = {5},
  number       = {3},
  year         = {2009},
  url          = {http://arxiv.org/abs/0907.0616},
  timestamp    = {Thu, 25 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0907-0616.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csl/WeisI07,
  author       = {Philipp Weis and
                  Neil Immerman},
  editor       = {Jacques Duparc and
                  Thomas A. Henzinger},
  title        = {Structure Theorem and Strict Alternation Hierarchy for FO\({}^{\mbox{2}}\)
                  on Words},
  booktitle    = {Computer Science Logic, 21st International Workshop, {CSL} 2007, 16th
                  Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15,
                  2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4646},
  pages        = {343--357},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74915-8\_27},
  doi          = {10.1007/978-3-540-74915-8\_27},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/csl/WeisI07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/WeisI07,
  author       = {Philipp Weis and
                  Neil Immerman},
  title        = {Structure Theorem and Strict Alternation Hierarchy for {FO2} on Words},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR07-008}},
  year         = {2007},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-008/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR07-008},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/WeisI07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Lange06,
  author       = {Martin Lange},
  title        = {The alternation hierarchy in fixpoint logic with chop is strict too},
  journal      = {Inf. Comput.},
  volume       = {204},
  number       = {9},
  pages        = {1346--1367},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.ic.2006.05.001},
  doi          = {10.1016/J.IC.2006.05.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Lange06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/dagstuhl/WeisI06,
  author       = {Philipp Weis and
                  Neil Immerman},
  editor       = {Thomas Schwentick and
                  Denis Th{\'{e}}rien and
                  Heribert Vollmer},
  title        = {Structure Theorem and Strict Alternation Hierarchy for FO\({}^{\mbox{2}}\)
                  on Words},
  booktitle    = {Circuits, Logic, and Games, 08.11. - 10.11.2006},
  series       = {Dagstuhl Seminar Proceedings},
  volume       = {06451},
  publisher    = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
                  (IBFI), Schloss Dagstuhl, Germany},
  year         = {2006},
  url          = {http://drops.dagstuhl.de/opus/volltexte/2007/975},
  timestamp    = {Thu, 10 Jun 2021 13:02:03 +0200},
  biburl       = {https://dblp.org/rec/conf/dagstuhl/WeisI06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ita/Arnold99,
  author       = {Andr{\'{e}} Arnold},
  title        = {p329 The {\(\mathrm{\mu}\)}-calculus alternation-depth hierarchy is
                  strict on binary trees},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {33},
  number       = {4/5},
  pages        = {329--340},
  year         = {1999},
  url          = {https://doi.org/10.1051/ita:1999121},
  doi          = {10.1051/ITA:1999121},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Arnold99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Bradfield98,
  author       = {Julian C. Bradfield},
  title        = {The Modal {\(\mathrm{\mu}\)}-Calculus Alternation Hierarchy is Strict},
  journal      = {Theor. Comput. Sci.},
  volume       = {195},
  number       = {2},
  pages        = {133--153},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0304-3975(97)00217-X},
  doi          = {10.1016/S0304-3975(97)00217-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Bradfield98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/concur/Bradfield96,
  author       = {Julian C. Bradfield},
  editor       = {Ugo Montanari and
                  Vladimiro Sassone},
  title        = {The Modal mu-calculus Alternation Hierarchy is Strict},
  booktitle    = {{CONCUR} '96, Concurrency Theory, 7th International Conference, Pisa,
                  Italy, August 26-29, 1996, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1119},
  pages        = {233--246},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/3-540-61604-7\_58},
  doi          = {10.1007/3-540-61604-7\_58},
  timestamp    = {Tue, 14 May 2019 10:00:43 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/Bradfield96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}