Pratt-Hartmann, Ian; Tendera, Lidia The fluted fragment with transitive relations. (English) Zbl 1490.03010 Ann. Pure Appl. Logic 173, No. 1, Article ID 103042, 43 p. (2022). Reviewer: Mario Alviano (Rende) MSC: 03B10 68Q17 68Q19 03B25 03B70 PDFBibTeX XMLCite \textit{I. Pratt-Hartmann} and \textit{L. Tendera}, Ann. Pure Appl. Logic 173, No. 1, Article ID 103042, 43 p. (2022; Zbl 1490.03010) Full Text: DOI arXiv
Pratt-Hartmann, Ian; Tendera, Lidia The fluted fragment with transitivity. (English) Zbl 07561662 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 18, 15 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{I. Pratt-Hartmann} and \textit{L. Tendera}, LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 18, 15 p. (2019; Zbl 07561662) Full Text: DOI arXiv
Szwast, Wiesław; Tendera, Lidia On the satisfiability problem for fragments of two-variable logic with one transitive relation. (English) Zbl 1444.03011 J. Log. Comput. 29, No. 6, 881-911 (2019). MSC: 03B25 03B20 68Q25 PDFBibTeX XMLCite \textit{W. Szwast} and \textit{L. Tendera}, J. Log. Comput. 29, No. 6, 881--911 (2019; Zbl 1444.03011) Full Text: DOI arXiv
Pratt-Hartmann, Ian; Szwast, Wiesław; Tendera, Lidia The fluted fragment revisited. (English) Zbl 1468.03005 J. Symb. Log. 84, No. 3, 1020-1048 (2019). MSC: 03B20 03B25 68Q17 PDFBibTeX XMLCite \textit{I. Pratt-Hartmann} et al., J. Symb. Log. 84, No. 3, 1020--1048 (2019; Zbl 1468.03005) Full Text: DOI arXiv Link
Kieroński, Emanuel; Tendera, Lidia Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants. (English) Zbl 1407.03009 ACM Trans. Comput. Log. 19, No. 2, Article No. 8, 34 p. (2018). MSC: 03B25 03C13 68Q25 PDFBibTeX XMLCite \textit{E. Kieroński} and \textit{L. Tendera}, ACM Trans. Comput. Log. 19, No. 2, Article No. 8, 34 p. (2018; Zbl 1407.03009) Full Text: DOI arXiv
Kieroński, Emanuel; Pratt-Hartmann, Ian; Tendera, Lidia Equivalence closure in the two-variable guarded fragment. (English) Zbl 1444.03116 J. Log. Comput. 27, No. 4, 999-1021 (2017). MSC: 03B70 03C13 03B25 68Q17 PDFBibTeX XMLCite \textit{E. Kieroński} et al., J. Log. Comput. 27, No. 4, 999--1021 (2017; Zbl 1444.03116) Full Text: DOI
Pratt-Hartmann, Ian; Szwast, Wieslaw; Tendera, Lidia Quine’s fluted fragment is non-elementary. (English) Zbl 1370.03019 Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 39, 21 p. (2016). MSC: 03B20 68Q25 PDFBibTeX XMLCite \textit{I. Pratt-Hartmann} et al., LIPIcs -- Leibniz Int. Proc. Inform. 62, Article 39, 21~p. (2016; Zbl 1370.03019) Full Text: DOI
Kieroński, Emanuel; Michaliszyn, Jakub; Pratt-Hartmann, Ian; Tendera, Lidia Two-variable first-order logic with equivalence closure. (English) Zbl 1341.03014 SIAM J. Comput. 43, No. 3, 1012-1063 (2014). MSC: 03B25 03B20 68Q17 68Q25 PDFBibTeX XMLCite \textit{E. Kieroński} et al., SIAM J. Comput. 43, No. 3, 1012--1063 (2014; Zbl 1341.03014) Full Text: DOI
Tendera, Lidia Means and limits of decision (invited talk). (English) Zbl 1356.03050 Ronchi della Rocca, Simona (ed.), Computer science logic 2013. Selected papers of the 27th CSL workshop and 22nd annual conference of the European Association for Computer Science Logic (EACSL), Torino, Italy, September 2–5, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-60-6). LIPIcs – Leibniz International Proceedings in Informatics 23, 28-29 (2013). MSC: 03B25 PDFBibTeX XMLCite \textit{L. Tendera}, LIPIcs -- Leibniz Int. Proc. Inform. 23, 28--29 (2013; Zbl 1356.03050) Full Text: DOI
Szwast, Wiesław; Tendera, Lidia \(\mathrm{FO}^2\) with one transitive relation is decidable. (English) Zbl 1354.03007 Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 317-328 (2013). MSC: 03B25 03B20 68Q25 PDFBibTeX XMLCite \textit{W. Szwast} and \textit{L. Tendera}, LIPIcs -- Leibniz Int. Proc. Inform. 20, 317--328 (2013; Zbl 1354.03007) Full Text: DOI
Gottlob, Georg; Pieris, Andreas; Tendera, Lidia Querying the guarded fragment with transitivity. (English) Zbl 1335.68078 Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-39211-5/pbk). Lecture Notes in Computer Science 7966, 287-298 (2013). MSC: 68P15 03B25 03B70 PDFBibTeX XMLCite \textit{G. Gottlob} et al., Lect. Notes Comput. Sci. 7966, 287--298 (2013; Zbl 1335.68078) Full Text: DOI
Kierónski, Emanuel; Michaliszyn, Jakub; Pratt-Hartmann, Ian; Tendera, Lidia Two-variable first-order logic with equivalence closure. (English) Zbl 1362.68107 Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25–28, 2012. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4769-5). 431-440 (2012). MSC: 68Q25 03B20 68Q17 PDFBibTeX XMLCite \textit{E. Kierónski} et al., in: Proceedings of the 2012 27th annual ACM/IEEE symposium on logic in computer science, LICS 2012, Dubrovnik, Croatia, June 25--28, 2012. Los Alamitos, CA: IEEE Computer Society. 431--440 (2012; Zbl 1362.68107) Full Text: DOI
Szwast, Wiesław; Tendera, Lidia On the finite satisfiability problem for the guarded fragment with transitivity. (English) Zbl 1143.03331 Sutcliffe, Geoff (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 12th international conference, LPAR 2005, Montego Bay, Jamaica, December 2–6, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-30553-8/pbk). Lecture Notes in Computer Science 3835, 307-321 (2005). MSC: 03B25 03B20 03C13 68Q17 68Q25 PDFBibTeX XMLCite \textit{W. Szwast} and \textit{L. Tendera}, Lect. Notes Comput. Sci. 3835, 307--321 (2005; Zbl 1143.03331) Full Text: DOI
Tendera, Lidia Counting in the two variable guarded logic with transitivity. (English) Zbl 1118.03313 Diekert, Volker (ed.) et al., STACS 2005. 22nd annual symposium on theoretical aspects of computer science, Stuttgart, Germany, February 24–26, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24998-2/pbk). Lecture Notes in Computer Science 3404, 83-96 (2005). MSC: 03B70 03B25 03D35 03D15 PDFBibTeX XMLCite \textit{L. Tendera}, Lect. Notes Comput. Sci. 3404, 83--96 (2005; Zbl 1118.03313) Full Text: DOI
Szwast, Wiesław; Tendera, Lidia The guarded fragment with transitive guards. (English) Zbl 1048.03010 Ann. Pure Appl. Logic 128, No. 1-3, 227-276 (2004). MSC: 03B25 03D15 68Q17 03B45 PDFBibTeX XMLCite \textit{W. Szwast} and \textit{L. Tendera}, Ann. Pure Appl. Logic 128, No. 1--3, 227--276 (2004; Zbl 1048.03010) Full Text: DOI
Pacholski, Leszek; Szwast, Wiesław; Tendera, Lidia Complexity results for first-order two-variable logic with counting. (English) Zbl 0956.03039 SIAM J. Comput. 29, No. 4, 1083-1117 (2000). Reviewer: U.Schöning (Ulm) MSC: 03D15 68Q15 03B10 68Q25 03B25 PDFBibTeX XMLCite \textit{L. Pacholski} et al., SIAM J. Comput. 29, No. 4, 1083--1117 (2000; Zbl 0956.03039) Full Text: DOI