×

Found 24 Documents (Results 1–24)

The ideal approach to computing closed subsets in well-quasi-orderings. (English) Zbl 1446.68191

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
PDFBibTeX XMLCite
Full Text: DOI arXiv HAL

The model checking problem for prefix classes of second-order logic: a survey. (English) Zbl 1287.68107

Blass, Andreas (ed.) et al., Fields of logic and computation. Essays dedicated to Yuri Gurevich on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-15024-1/pbk). Lecture Notes in Computer Science 6300, 227-250 (2010).
MSC:  68Q60 03B15 03C13 68Q45 68-02
PDFBibTeX XMLCite
Full Text: DOI

The algebraic counterpart of the Wagner hierarchy. (English) Zbl 1143.68047

Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 100-109 (2008).
MSC:  68Q70 03E15 91A44
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software