×

zbMATH — the first resource for mathematics

Found 128 Documents (Results 1–100)

100
MathJax
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 351-391 (2020).
MSC:  03Fxx 03Exx 03Dxx
PDF BibTeX XML Cite
Full Text: DOI
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 339-350 (2020).
MSC:  68V20 03B35 03E05
PDF BibTeX XML Cite
Full Text: DOI
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 271-319 (2020).
MSC:  03-XX
PDF BibTeX XML Cite
Full Text: DOI
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 189-219 (2020).
MSC:  03Exx 68Nxx
PDF BibTeX XML Cite
Full Text: DOI
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 161-188 (2020).
MSC:  05C99 06A06 05C20
PDF BibTeX XML Cite
Full Text: DOI
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 107-125 (2020).
MSC:  03-XX
PDF BibTeX XML Cite
Full Text: DOI
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 55-105 (2020).
MSC:  68W05 03E05
PDF BibTeX XML Cite
Full Text: DOI
Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 29-54 (2020).
MSC:  03Exx 06Axx
PDF BibTeX XML Cite
Full Text: DOI
Kordon, Fabrice (ed.) et al., Application and theory of Petri nets and concurrency. 37th international conference, PETRI NETS 2016, Toruń, Poland, June 19–24, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-39085-7/pbk; 978-3-319-39086-4/ebook). Lecture Notes in Computer Science 9698, 20-36 (2016).
MSC:  68Q85
PDF BibTeX XML Cite
Full Text: DOI
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 228-256 (2012).
PDF BibTeX XML Cite
Full Text: DOI
Ambos-Spies, Klaus (ed.) et al., Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03072-7/pbk). Lecture Notes in Computer Science 5635, 11-20 (2009).
MSC:  03E20 03D20 03E10
PDF BibTeX XML Cite
Full Text: DOI
King, Andy (ed.), Logic-based program synthesis and transformation. 17th international symposium, LOPSTR 2007, Kongens Lyngby, Denmark, August 23–24, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-78768-6/pbk). Lecture Notes in Computer Science 4915, 23-42 (2008).
MSC:  68N30
PDF BibTeX XML Cite
Full Text: DOI
Program. Comput. Softw. 33, No. 1, 14-23 (2007); translation from Programmirovanie 33, No. 1, 22-34 (2007).
MSC:  68N20 68Q60
PDF BibTeX XML Cite
Full Text: DOI
Gadducci, Fabio (ed.) et al., WRLA 2002. Proceedings of the 4th international workshop on rewriting logic and its applications, Pisa, Italy, September 19–21, 2002. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 71, 188-207 (2004).
MSC:  68Q42
PDF BibTeX XML Cite
Full Text: Link
de Queiroz, Ruy (ed.) et al., Proceedings of the 10th workshop on logic, language, information and computation (WoLLIC’2003), Ouro Preto, Minas Gerais, Brazil, July 29 – August 1, 2003. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 84, 80-90 (2003).
MSC:  03E05 05C05
PDF BibTeX XML Cite
Full Text: DOI
Alferes, José Júlio (ed.) et al., Logics in artificial intelligence. European workshop, JELIA ’96, Évora, Portugal, September 30 – October 3, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1126, 50-69 (1996).
MSC:  03B35 68V15
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Year of Publication
all top 3
Classification
Biographic Reference
all top 3
Software