Immerman, Neil; Kozen, Dexter Definability with bounded number of bound variables. (English) Zbl 0711.03004 Inf. Comput. 83, No. 2, 121-139 (1989). Reviewer: J.Šefránek MSC: 03B70 03C30 03B45 03C13 68Q55 PDFBibTeX XMLCite \textit{N. Immerman} and \textit{D. Kozen}, Inf. Comput. 83, No. 2, 121--139 (1989; Zbl 0711.03004) Full Text: DOI
Nivat, M.; Saoudi, A. Automata on infinite objects and their applications to logic and programming. (English) Zbl 0691.68068 Inf. Comput. 83, No. 1, 41-64 (1989). Reviewer: M.Steinby MSC: 68Q45 03D05 68Q60 68T99 PDFBibTeX XMLCite \textit{M. Nivat} and \textit{A. Saoudi}, Inf. Comput. 83, No. 1, 41--64 (1989; Zbl 0691.68068) Full Text: DOI
Peleg, David Communication in concurrent dynamic logic. (English) Zbl 0632.68032 J. Comput. Syst. Sci. 35, 23-58 (1987). Reviewer: L.Brim MSC: 68Q65 68Q60 03B70 PDFBibTeX XMLCite \textit{D. Peleg}, J. Comput. Syst. Sci. 35, 23--58 (1987; Zbl 0632.68032) Full Text: DOI
Peleg, David Concurrent program schemes and their logics. (English) Zbl 0631.68016 Theor. Comput. Sci. 55, 1-45 (1987). MSC: 68Q60 68N25 03B70 PDFBibTeX XMLCite \textit{D. Peleg}, Theor. Comput. Sci. 55, 1--45 (1987; Zbl 0631.68016) Full Text: DOI
Schlipf, John S. Decidability and definability with circumscription. (English) Zbl 0625.03017 Ann. Pure Appl. Logic 35, 173-191 (1987). Reviewer: G.Mints MSC: 03C85 68T99 03B25 PDFBibTeX XMLCite \textit{J. S. Schlipf}, Ann. Pure Appl. Logic 35, 173--191 (1987; Zbl 0625.03017) Full Text: DOI
Urzyczyn, Paweł “During” cannot be expressed by “after”. (English) Zbl 0607.03008 J. Comput. Syst. Sci. 32, 97-104 (1986). Reviewer: J.Hořejš MSC: 03B70 68N01 68Q25 PDFBibTeX XMLCite \textit{P. Urzyczyn}, J. Comput. Syst. Sci. 32, 97--104 (1986; Zbl 0607.03008) Full Text: DOI
Tiomkin, M. L.; Makowsky, J. A. Propositional dynamic logic with local assignments. (English) Zbl 0574.03011 Theor. Comput. Sci. 36, 71-87 (1985). Reviewer: G.Mints MSC: 03B45 68Q65 PDFBibTeX XMLCite \textit{M. L. Tiomkin} and \textit{J. A. Makowsky}, Theor. Comput. Sci. 36, 71--87 (1985; Zbl 0574.03011) Full Text: DOI
Harel, David; Peleg, David More on looping vs. repeating in dynamic logic. (English) Zbl 0559.68049 Inf. Process. Lett. 20, 87-90 (1985). Reviewer: H.Nishimura MSC: 68Q65 68Q60 03B45 PDFBibTeX XMLCite \textit{D. Harel} and \textit{D. Peleg}, Inf. Process. Lett. 20, 87--90 (1985; Zbl 0559.68049) Full Text: DOI
Kfoury, A. J.; Urzyczyn, Pawel Necessary and sufficient conditions for the universality of programming formalisms. (English) Zbl 0552.68008 Acta Inf. 22, 347-377 (1985). MSC: 68Q60 03D60 68P05 03D20 PDFBibTeX XMLCite \textit{A. J. Kfoury} and \textit{P. Urzyczyn}, Acta Inf. 22, 347--377 (1985; Zbl 0552.68008) Full Text: DOI
Meyer, Albert R.; Tiuryn, Jerzy Equivalences among logics of programs. (English) Zbl 0552.68037 J. Comput. Syst. Sci. 29, 160-170 (1984). Reviewer: J.-J.Ch.Meyer MSC: 68Q65 68Q60 PDFBibTeX XMLCite \textit{A. R. Meyer} and \textit{J. Tiuryn}, J. Comput. Syst. Sci. 29, 160--170 (1984; Zbl 0552.68037) Full Text: DOI
Parikh, Rohit Some applications of topology to program semantics. (English) Zbl 0548.68011 Math. Syst. Theory 16, 111-131 (1983). MSC: 68Q60 06A15 06B30 68Q65 06A06 PDFBibTeX XMLCite \textit{R. Parikh}, Math. Syst. Theory 16, 111--131 (1983; Zbl 0548.68011) Full Text: DOI
Kfoury, A. J. Definability by programs in first-order structures. (English) Zbl 0499.68009 Theor. Comput. Sci. 25, 1-66 (1983). MSC: 68Q60 03C99 03D99 68Q65 PDFBibTeX XMLCite \textit{A. J. Kfoury}, Theor. Comput. Sci. 25, 1--66 (1983; Zbl 0499.68009) Full Text: DOI
Harel, David; Kozen, Dexter; Parikh, Rohit Process logic: Expressiveness, decidability, completeness. (English) Zbl 0494.03016 J. Comput. Syst. Sci. 25, 144-170 (1982). MSC: 03B45 68Q65 68N01 PDFBibTeX XMLCite \textit{D. Harel} et al., J. Comput. Syst. Sci. 25, 144--170 (1982; Zbl 0494.03016) Full Text: DOI
Meyer, Albert R.; Winklmann, Karl Expressing program looping in regular dynamic logic. (English) Zbl 0478.68031 Theor. Comput. Sci. 18, 301 (1982). MSC: 68Q65 68N01 03B60 PDFBibTeX XMLCite \textit{A. R. Meyer} and \textit{K. Winklmann}, Theor. Comput. Sci. 18, 301 (1982; Zbl 0478.68031) Full Text: DOI