×

Found 932 Documents (Results 1–100)

100
MathJax

The order type of scattered context-free orderings of rank one is computable. (English) Zbl 1440.68155

Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 273-284 (2020).
MSC:  68Q45 06A05
PDF BibTeX XML Cite
Full Text: DOI arXiv

About the temporal logic of the lexicographic products of unbounded dense linear orders: a new study of its computability. (English) Zbl 07220053

Ju, Shier (ed.) et al., Nonclassical logics and their applications. Post-proceedings of the 8th international workshop on logic and cognition, WOLC 2016, Guangzhou, China, December 5–9, 2016. Singapore: Springer. Log. Asia: Stud. Log. Libr., 67-83 (2020).
PDF BibTeX XML Cite
Full Text: DOI HAL

Well, better and in-between. (English) Zbl 1481.03047

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, 1-27 (2020).
MSC:  03E15 06A05 06A06
PDF BibTeX XML Cite
Full Text: DOI Link

Relations: concrete, abstract, and applied. An introduction. (English) Zbl 1460.03001

Hackensack, NJ: World Scientific (ISBN 978-981-12-2034-0/hbk; 978-981-12-2036-4/ebook). xx, 552 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI

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. (English) Zbl 1443.03002

Trends in Logic – Studia Logica Library 53. Cham: Springer (ISBN 978-3-030-30228-3/hbk; 978-3-030-30229-0/ebook). x, 391 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI

Dualization problem over the product of chains: asymptotic estimates for the number of solutions. (English. Russian original) Zbl 07036523

Dokl. Math. 98, No. 3, 564-567 (2018); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 483, No. 2, 130-133 (2018).
MSC:  68R05 06A05
PDF BibTeX XML Cite
Full Text: DOI

Computable linear orders and the Ershov hierarchy. (English. Russian original) Zbl 1386.03052

Russ. Math. 62, No. 1, 58-64 (2018); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2018, No. 1, 67-74 (2018).
MSC:  03D45 03D55 06A05
PDF BibTeX XML Cite
Full Text: DOI

Valuation theory of exponential Hardy fields. II: Principal parts of germs in the Hardy field of o-minimal exponential expansions of the reals. Dedicated to the memory of Murray Marshall. (English) Zbl 1437.03131

Broglia, Fabrizio (ed.) et al., Ordered algebraic structures and related topics. International conference at CIRM, Luminy, France, October 12–16, 2015. Proceedings. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 697, 227-237 (2017).
PDF BibTeX XML Cite
Full Text: DOI

Counting linear extensions: parameterizations by treewidth. (English) Zbl 1397.68098

Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 39, 18 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

Biographic Reference

all top 3

Software