Gutierrez, Julian; Harrenstein, Paul; Wooldridge, Michael Reasoning about equilibria in game-like concurrent systems. (English) Zbl 1400.03057 Ann. Pure Appl. Logic 168, No. 2, 373-403 (2017). Reviewer: Martin Lange (Kassel) MSC: 03B70 03B44 91A40 68T27 68Q60 PDFBibTeX XMLCite \textit{J. Gutierrez} et al., Ann. Pure Appl. Logic 168, No. 2, 373--403 (2017; Zbl 1400.03057) Full Text: DOI
Kamide, Norihiro Bounded linear-time temporal logic: a proof-theoretic investigation. (English) Zbl 1241.03015 Ann. Pure Appl. Logic 163, No. 4, 439-466 (2012). MSC: 03B44 03B45 03F05 PDFBibTeX XMLCite \textit{N. Kamide}, Ann. Pure Appl. Logic 163, No. 4, 439--466 (2012; Zbl 1241.03015) Full Text: DOI
Santocanale, Luigi; Venema, Yde Completeness for flat modal fixpoint logics. (English) Zbl 1225.03020 Ann. Pure Appl. Logic 162, No. 1, 55-82 (2010). MSC: 03B45 03B70 06E25 PDFBibTeX XMLCite \textit{L. Santocanale} and \textit{Y. Venema}, Ann. Pure Appl. Logic 162, No. 1, 55--82 (2010; Zbl 1225.03020) Full Text: DOI Link
Rybakov, V. Linear temporal logic with until and next, logical consecutions. (English) Zbl 1147.03008 Ann. Pure Appl. Logic 155, No. 1, 32-45 (2008). MSC: 03B44 03B25 03B70 PDFBibTeX XMLCite \textit{V. Rybakov}, Ann. Pure Appl. Logic 155, No. 1, 32--45 (2008; Zbl 1147.03008) Full Text: DOI
Santocanale, Luigi Completions of \(\mu \)-algebras. (English) Zbl 1146.03042 Ann. Pure Appl. Logic 154, No. 1, 27-50 (2008). Reviewer: Valentin F. Goranko (Johannesburg) MSC: 03G25 03B45 03B70 06B23 PDFBibTeX XMLCite \textit{L. Santocanale}, Ann. Pure Appl. Logic 154, No. 1, 27--50 (2008; Zbl 1146.03042) Full Text: DOI arXiv
Lassaigne, Richard; Peyronnet, Sylvain Probabilistic verification and approximation. (English) Zbl 1142.68050 Ann. Pure Appl. Logic 152, No. 1-3, 122-131 (2008). MSC: 68Q60 68W20 68W25 PDFBibTeX XMLCite \textit{R. Lassaigne} and \textit{S. Peyronnet}, Ann. Pure Appl. Logic 152, No. 1--3, 122--131 (2008; Zbl 1142.68050) Full Text: DOI
Dekhtyar, Michael; Dikovsky, Alexander; Valiev, Mars On complexity of verification of interacting agents’ behavior. (English) Zbl 1096.68143 Ann. Pure Appl. Logic 141, No. 3, 336-362 (2006). MSC: 68T27 03B44 68Q60 68Q85 PDFBibTeX XMLCite \textit{M. Dekhtyar} et al., Ann. Pure Appl. Logic 141, No. 3, 336--362 (2006; Zbl 1096.68143) Full Text: DOI
Kupferman, Orna; Safra, Shmuel; Vardi, Moshe Y. Relating word and tree automata. (English) Zbl 1097.03034 Ann. Pure Appl. Logic 138, No. 1-3, 126-146 (2006). Reviewer: Aleksej Dmitrievich Korshunov (Novosibirsk) MSC: 03D05 68Q45 PDFBibTeX XMLCite \textit{O. Kupferman} et al., Ann. Pure Appl. Logic 138, No. 1--3, 126--146 (2006; Zbl 1097.03034) Full Text: DOI
Dixon, Clare; Bolotov, Alexander; Fisher, Michael Alternating automata and temporal logic normal forms. (English) Zbl 1087.03013 Ann. Pure Appl. Logic 135, No. 1-3, 263-285 (2005). MSC: 03B44 68Q45 68Q60 PDFBibTeX XMLCite \textit{C. Dixon} et al., Ann. Pure Appl. Logic 135, No. 1--3, 263--285 (2005; Zbl 1087.03013) Full Text: DOI
Baratella, Stefano; Masini, Andrea A proof-theoretic investigation of a logic of positions. (English) Zbl 1023.03052 Ann. Pure Appl. Logic 123, No. 1-3, 135-162 (2003). MSC: 03F05 03B45 03F25 03B22 PDFBibTeX XMLCite \textit{S. Baratella} and \textit{A. Masini}, Ann. Pure Appl. Logic 123, No. 1--3, 135--162 (2003; Zbl 1023.03052) Full Text: DOI
Beauquier, Danièle; Slissenko, Anatol A first order logic for specification of timed algorithms: Basic properties and a decidable class. (English) Zbl 0988.03055 Ann. Pure Appl. Logic 113, No. 1-3, 13-52 (2002). MSC: 03B70 68Q60 03B25 PDFBibTeX XMLCite \textit{D. Beauquier} and \textit{A. Slissenko}, Ann. Pure Appl. Logic 113, No. 1--3, 13--52 (2002; Zbl 0988.03055) Full Text: DOI
Klarlund, Nils Progress measures, immediate determinacy, and a subset construction for tree automata. (English) Zbl 0821.68084 Ann. Pure Appl. Logic 69, No. 2-3, 243-268 (1994). MSC: 68Q45 91A99 PDFBibTeX XMLCite \textit{N. Klarlund}, Ann. Pure Appl. Logic 69, No. 2--3, 243--268 (1994; Zbl 0821.68084) Full Text: DOI
Vardi, Moshe Y. Verification of concurrent programs: The automata-theoretic framework. (English) Zbl 0725.03013 Ann. Pure Appl. Logic 51, No. 1-2, 79-98 (1991). Reviewer: A.P.Stolboushkin (Pereslavl-Zalessky) MSC: 03B70 03D05 68Q60 68Q10 PDFBibTeX XMLCite \textit{M. Y. Vardi}, Ann. Pure Appl. Logic 51, No. 1--2, 79--98 (1991; Zbl 0725.03013) Full Text: DOI
Compton, Kevin J.; Henson, C. Ward A uniform method for proving lower bounds on the computational complexity of logical theories. (English) Zbl 0705.03017 Ann. Pure Appl. Logic 48, No. 1, 1-79 (1990). Reviewer: M.Zimand MSC: 03D15 PDFBibTeX XMLCite \textit{K. J. Compton} and \textit{C. W. Henson}, Ann. Pure Appl. Logic 48, No. 1, 1--79 (1990; Zbl 0705.03017) Full Text: DOI