BibTeX records: Marius Petria

download as .bib file

@article{DBLP:journals/tcs/Petria12,
  author    = {Marius Petria},
  title     = {Generic constructions for behavioral specifications},
  journal   = {Theor. Comput. Sci.},
  volume    = {415},
  pages     = {39--59},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.tcs.2011.10.025},
  doi       = {10.1016/j.tcs.2011.10.025},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/tcs/Petria12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/DiaconescuP10,
  author    = {Razvan Diaconescu and
               Marius Petria},
  title     = {Saturated models in institutions},
  journal   = {Arch. Math. Log.},
  volume    = {49},
  number    = {6},
  pages     = {693--723},
  year      = {2010},
  url       = {https://doi.org/10.1007/s00153-010-0193-8},
  doi       = {10.1007/s00153-010-0193-8},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/aml/DiaconescuP10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/GainaP10,
  author    = {Daniel G{\^{a}}in{\^{a}} and
               Marius Petria},
  title     = {Completeness by Forcing},
  journal   = {J. Log. Comput.},
  volume    = {20},
  number    = {6},
  pages     = {1165--1186},
  year      = {2010},
  url       = {https://doi.org/10.1093/logcom/exq012},
  doi       = {10.1093/logcom/exq012},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/logcom/GainaP10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/calco/Petria07,
  author    = {Marius Petria},
  editor    = {Till Mossakowski and
               Ugo Montanari and
               Magne Haveraaen},
  title     = {An Institutional Version of G{\"{o}}del's Completeness Theorem},
  booktitle = {Algebra and Coalgebra in Computer Science, Second International Conference,
               {CALCO} 2007, Bergen, Norway, August 20-24, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4624},
  pages     = {409--424},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-73859-6\_28},
  doi       = {10.1007/978-3-540-73859-6\_28},
  timestamp = {Tue, 14 May 2019 10:00:51 +0200},
  biburl    = {https://dblp.org/rec/conf/calco/Petria07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/DiaconescuP06,
  author    = {Razvan Diaconescu and
               Marius Petria},
  title     = {Abstract Beth definability in institutions},
  journal   = {J. Symb. Log.},
  volume    = {71},
  number    = {3},
  pages     = {1002--1028},
  year      = {2006},
  url       = {https://doi.org/10.2178/jsl/1154698588},
  doi       = {10.2178/jsl/1154698588},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jsyml/DiaconescuP06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics