×

Found 102 Documents (Results 1–100)

100
MathJax

Well-quasi orders and hierarchy theory. (English) Zbl 07218745

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 arXiv

Deciding piecewise testable separability for regular tree languages. (English) Zbl 1388.68172

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 97, 15 p. (2016).
MSC:  68Q45 03D05
PDF BibTeX XML Cite
Full Text: DOI

On invariance of monounary algebras. (English) Zbl 1234.08007

Chajda, I. (ed.) et al., Proceedings of the 79th workshop on general algebra “79. Arbeitstagung Allgemeine Algebra”, 25th conference of young algebraists, Palacký University Olomouc, Olomouc, Czech Republic, February 12–14, 2010. Klagenfurt: Verlag Johannes Heyn (ISBN 978-3-7084-0407-3/pbk). Contributions to General Algebra 19, 113-126 (2010).
MSC:  08A60
PDF BibTeX XML Cite

Genomorphisms of monounary algebras. (English) Zbl 1237.08003

Chajda, I. (ed.) et al., Proceedings of the 79th workshop on general algebra “79. Arbeitstagung Allgemeine Algebra”, 25th conference of young algebraists, Palacký University Olomouc, Olomouc, Czech Republic, February 12–14, 2010. Klagenfurt: Verlag Johannes Heyn (ISBN 978-3-7084-0407-3/pbk). Contributions to General Algebra 19, 25-32 (2010).
MSC:  08A60 08A35
PDF BibTeX XML Cite

Undecidability in Weihrauch degrees. (English) Zbl 1286.03143

Ferreira, Fernando (ed.) et al., Programs, proofs, processes. 6th conference on computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30–July 4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13961-1/pbk). Lecture Notes in Computer Science 6158, 256-265 (2010).
MSC:  03D35
PDF BibTeX XML Cite
Full Text: DOI

A Gandy theorem for abstract structures and applications to first-order definability. (English) Zbl 1268.03038

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, 290-299 (2009).
MSC:  03C40 03C62
PDF BibTeX XML Cite
Full Text: DOI

Endomorphisms of quasiorders and related lattices. (English) Zbl 1147.08001

Dorfer, G. (ed.) et al., Proceedings of the 73rd workshop on general algebra “73. Arbeitstagung Allgemeine Algebra”, 22nd conference of young algebraists, Alps-Adriatic-University of Klagenfurt, Austria, February 1–4, 2007. Klagenfurt: Verlag Johannes Heyn (ISBN 978-3-7084-0303-8/pbk). Contributions to General Algebra 18, 113-128 (2008).
MSC:  08A35 08A40 08A60
PDF BibTeX XML Cite

Definability in the homomorphic quasiorder of finite labeled forests. (English) Zbl 1150.03312

Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 436-445 (2007).
MSC:  03C40 05C05 06A06
PDF BibTeX XML Cite
Full Text: DOI

Undecidability in the homomorphic quasiorder of finite labeled forests. (English) Zbl 1145.03307

Beckmann, Arnold (ed.) et al., Logical approaches to computational barriers. Second conference on computability in Europe, CiE 2006, Swansea, UK, June 30–July 5, 2006. Proceedings. Berlin: Springer (ISBN 3-540-35466-2/pbk). Lecture Notes in Computer Science 3988, 289-296 (2006).
MSC:  03B25 05C05
PDF BibTeX XML Cite
Full Text: DOI

Quasiorders on topological categories. (English) Zbl 0989.54016

Simon, Petr (ed.), Proceedings of the 9th Prague topological symposium, Prague, Czech Republic, August 19-25, 2001. Toronto: Topology Atlas. 321-330, electronic only (2002).
MSC:  54B30 54H10
PDF BibTeX XML Cite
Full Text: arXiv EMIS

Quasiorder contexts for total negation. (English) Zbl 0914.54003

Simon, Petr (ed.), Proceedings of the 8th Prague topological symposium, Prague, Czech Republic, August 18–24, 1996. North Bay, ON: Topology Atlas, 283-287 (1997).
MSC:  54A25 06A06 54A05 18B30 54B30
PDF BibTeX XML Cite
Full Text: Link

Procedure for designing a quasiorder on a set of multiattributed alternatives using reliable information about a decision-maker’s preferences. (English. Russian original) Zbl 0613.90055

Autom. Remote Control 47, 1258-1267 (1986); translation from Avtom. Telemekh. 1986, No. 9, 104-113 (1986).
MSC:  90B50 91B08
PDF BibTeX XML Cite

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

Software