Pal’chunov, D. E. On pseudo-Boolean algebras with a finite number of dense elements. (Russian) Zbl 0709.06006 Computable invariants in the theory of algebraic systems, Collect. Sci. Works, Novosibirsk, 35-45 (1987). Reviewer: O.V.Belegradek MSC: 06D15 03C60 PDFBibTeX XML
Denisov, A. S. Every decidable theory has an \(0'\)-strongly constructive homogeneous model. (Russian) Zbl 0709.03024 Computable invariants in the theory of algebraic systems, Collect. Sci. Works, Novosibirsk, 13-21 (1987). Reviewer: A.S.Morozov MSC: 03C57 03D45 03B25 PDFBibTeX XML
Nepomniaschij, V. A.; Shilov, N. V. Non-deterministic program schemata and their relation to dynamic logic. (English) Zbl 0704.03011 Mathematical logic and its applications, Proc. Adv. Int. Summer Sch. Conf., Druzhba/Bulg. 1986, 137-147 (1987). Reviewer: Luboš Brim (Brno) MSC: 03B70 68Q10 03B45 68Q60 PDFBibTeX XML
Sanchez-Mazas, Miguel Une nouvelle méthode de décision. Identification et analyse des classes d’équivalence de la logique modale par des invariants numériques. (A new decision method. Identification and analysis of equivalence classes of modal logic by numerical invariants). (French) Zbl 0699.03007 Logique Anal., Nouv. Sér. 30, No. 120, 401-439 (1987). Reviewer: V.Shekhtman MSC: 03B45 03B25 PDFBibTeX XMLCite \textit{M. Sanchez-Mazas}, Log. Anal., Nouv. Sér. 30, No. 120, 401--439 (1987; Zbl 0699.03007)
Börger, Egon; Löwen, Ulrich Logical decision problems and complexity of logic programs. (English) Zbl 0691.03022 Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 10, 1-33 (1987). MSC: 03D15 03B25 68T15 68Q25 PDFBibTeX XMLCite \textit{E. Börger} and \textit{U. Löwen}, Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 10, 1--33 (1987; Zbl 0691.03022)
Crvenković, S.; Madarász, R. On a problem of partial algebras. (English) Zbl 0686.08006 Zb. Rad., Prir.-Mat. Fak., Univ. Novom Sadu, Ser. Mat. 17, No. 2, 39-55 (1987). MSC: 08A55 08A50 03C05 03B25 PDFBibTeX XMLCite \textit{S. Crvenković} and \textit{R. Madarász}, Zb. Rad., Prir.-Mat. Fak., Univ. Novom Sadu, Ser. Mat. 17, No. 2, 39--55 (1987; Zbl 0686.08006)
Honkala, Juha It is decidable whether or not a permutation-free morphism is an L code. (English) Zbl 0684.68091 Int. J. Comput. Math. 22, No. 1, 1-11 (1987). Reviewer: W.Buszkowski MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Honkala}, Int. J. Comput. Math. 22, No. 1, 1--11 (1987; Zbl 0684.68091) Full Text: DOI
Policriti, Alberto Completeness and decidability of the deducibility problem for some class of formulas of set theory. (English) Zbl 0682.03005 Matematiche 42, No. 1-2, 49-66 (1987). MSC: 03B25 03E99 PDFBibTeX XMLCite \textit{A. Policriti}, Matematiche 42, No. 1--2, 49--66 (1987; Zbl 0682.03005)
Kuich, Werner Unambiguous automata. (English) Zbl 0668.68063 Bull. EATCS 33, 62-67 (1987). Reviewer: A.V.Anisimov MSC: 68Q70 03D05 20M35 20F10 PDFBibTeX XMLCite \textit{W. Kuich}, Bull. EATCS 33, 62--67 (1987; Zbl 0668.68063)
Cantone, D.; Ferro, A. Some recent decidability results in set theory. (English) Zbl 0667.03007 Atti degli incontri di logica matematica, Vol. 3, Siena & Padova/Italia 1985/86, 383-387 (1987). Reviewer: A.Pettorossi MSC: 03B25 03E99 PDFBibTeX XML
Gerla, Giangiacomo The theory of L-subsets and recursiveness. (Italian) Zbl 0665.03030 Atti degli incontri di logica matematica, Vol. 3, Siena & Padova/Italia 1985/86, 395-398 (1987). Reviewer: A.Pettorossi MSC: 03D20 03B52 03E72 PDFBibTeX XML
Zamov, N. K.; Sharonov, V. I. Decision tactics for derivation search in the resolution method. (English. Russian original) Zbl 0664.03010 J. Sov. Math. 39, No. 5, 2969-2971 (1987); translation from Issled. Prikl. Mat. 4, 31-34 (1977). MSC: 03B35 03B25 PDFBibTeX XMLCite \textit{N. K. Zamov} and \textit{V. I. Sharonov}, J. Sov. Math. 39, No. 5, 2969--2971 (1987; Zbl 0664.03010); translation from Issled. Prikl. Mat. 4, 31--34 (1977) Full Text: DOI
Pheidas, Thanases An undecidability result for power series rings of positive characteristics. II. (English) Zbl 0664.03008 Proc. Am. Math. Soc. 100, 526-530 (1987). MSC: 03B25 12L05 13F25 11U05 11D88 PDFBibTeX XMLCite \textit{T. Pheidas}, Proc. Am. Math. Soc. 100, 526--530 (1987; Zbl 0664.03008) Full Text: DOI
Ochmański, Edward A non-invertible PCF language. (English) Zbl 0663.68086 Bull. EATCS 33, 83-84 (1987). Reviewer: F.-L.Tiplea MSC: 68Q45 PDFBibTeX XMLCite \textit{E. Ochmański}, Bull. EATCS 33, 83--84 (1987; Zbl 0663.68086)
Pal’chunov, D. E. Finitely axiomatizable Boolean algebras with distinguished ideals. (English. Russian original) Zbl 0661.03022 Algebra Logic 26, No. 4, 252-266 (1987); translation from Algebra Logika 26, No. 4, 435-455 (1987). MSC: 03C35 06E99 PDFBibTeX XMLCite \textit{D. E. Pal'chunov}, Algebra Logic 26, No. 4, 252--266 (1987; Zbl 0661.03022); translation from Algebra Logika 26, No. 4, 435--455 (1987) Full Text: DOI
Vazhenin, Yu. M. Algorithmic problems and hierarchies of first-order languages. (English. Russian original) Zbl 0661.03005 Algebra Logic 26, No. 4, 241-252 (1987); translation from Algebra Logika 26, No. 4, 419-434 (1987). MSC: 03B25 03D55 PDFBibTeX XMLCite \textit{Yu. M. Vazhenin}, Algebra Logic 26, No. 4, 241--252 (1987; Zbl 0661.03005); translation from Algebra Logika 26, No. 4, 419--434 (1987) Full Text: DOI
Ferro, A.; Omodeo, E. G. Decision procedures for elementary sublanguages of set theory. VII: Validity in set theory when a choice operator is present. (English) Zbl 0656.03007 Commun. Pure Appl. Math. 40, No. 3, 265-280 (1987). Reviewer: J.M.Plotkin MSC: 03B25 03E99 PDFBibTeX XMLCite \textit{A. Ferro} and \textit{E. G. Omodeo}, Commun. Pure Appl. Math. 40, No. 3, 265--280 (1987; Zbl 0656.03007) Full Text: DOI Link
Cantone, D.; Ferro, A.; Omodeo, E.; Schwartz, J. T. Decision algorithms for some fragments of analysis and related areas. (English) Zbl 0656.03006 Commun. Pure Appl. Math. 40, No. 3, 281-300 (1987). Reviewer: J.M.Plotkin MSC: 03B25 PDFBibTeX XMLCite \textit{D. Cantone} et al., Commun. Pure Appl. Math. 40, No. 3, 281--300 (1987; Zbl 0656.03006) Full Text: DOI Link
Kunen, Kenneth Negation in logic programming. (English) Zbl 0655.68018 J. Logic Program. 4, 289-308 (1987). Reviewer: G.Mints MSC: 68Q60 68Q65 68T15 PDFBibTeX XMLCite \textit{K. Kunen}, J. Log. Program. 4, 289--308 (1987; Zbl 0655.68018) Full Text: DOI
Idziak, Paweł M. Undedidability of free pseudocomplemented distributive lattices. (English) Zbl 0655.03006 Rep. Math. Logic 21, 97-100 (1987). Reviewer: C.Masalagiu MSC: 03B25 06D15 PDFBibTeX XMLCite \textit{P. M. Idziak}, Rep. Math. Logic 21, 97--100 (1987; Zbl 0655.03006)
Mekler, Alan H.; Nelson, Evelyn M. Equational bases for if-then-else. (English) Zbl 0654.68029 SIAM J. Comput. 16, 465-485 (1987). MSC: 68Q65 08B05 68Q60 PDFBibTeX XMLCite \textit{A. H. Mekler} and \textit{E. M. Nelson}, SIAM J. Comput. 16, 465--485 (1987; Zbl 0654.68029) Full Text: DOI
Anisimov, A. V.; Oleshchuk, V. A. Church-Rosser systems with respect to formal languages. (English. Russian original) Zbl 0651.68101 Cybernetics 23, No. 5, 590-599 (1987); translation from Kibernetika 1987, No. 5, 19-25 (1987). Reviewer: J.Hromkovič MSC: 68Q45 08A50 03D35 20M05 03D03 03D40 PDFBibTeX XMLCite \textit{A. V. Anisimov} and \textit{V. A. Oleshchuk}, Cybernetics 23, No. 5, 590--599 (1987; Zbl 0651.68101); translation from Kibernetika 1987, No. 5, 19--25 (1987) Full Text: DOI
Horváth, Sándor; Kinber, Efim; Salomaa, Arto; Yu, Sheng Decision problems resulting from grammatical inference. (English) Zbl 0649.68078 Ann. Acad. Sci. Fenn., Ser. A I, Math. 12, No. 2, 287-298 (1987). Reviewer: G.Slutzki MSC: 68Q45 68T05 PDFBibTeX XMLCite \textit{S. Horváth} et al., Ann. Acad. Sci. Fenn., Ser. A I, Math. 12, No. 2, 287--298 (1987; Zbl 0649.68078) Full Text: DOI
Tuschik, Hans-Peter The expressive power of Malitz quantifiers for linear orderings. (English) Zbl 0649.03027 Ann. Pure Appl. Logic 36, 53-103 (1987). Reviewer: D.Mundici MSC: 03C80 03C10 03C52 03C65 06A05 03B25 PDFBibTeX XMLCite \textit{H.-P. Tuschik}, Ann. Pure Appl. Logic 36, 53--103 (1987; Zbl 0649.03027) Full Text: DOI
Lindenmayer, A. Models for multicellular development: Characterization, inference and complexity of L-systems. (English) Zbl 0648.92002 Trends, techniques, and problems in theoretical computer science, 4th Int. Meet. Young Comput. Sci., Smolenice/Czech. 1986, Lect. Notes Comput. Sci. 281, 138-168 (1987). Reviewer: P.Jirků MSC: 92B05 68Q42 PDFBibTeX XML
Thuraisingham, M. B. Reducibility relationships between decision problems for system functions. (English) Zbl 0647.03036 Z. Math. Logik Grundlagen Math. 33, 305-312 (1987). MSC: 03D30 03B25 PDFBibTeX XMLCite \textit{M. B. Thuraisingham}, Z. Math. Logik Grundlagen Math. 33, 305--312 (1987; Zbl 0647.03036) Full Text: DOI
Pal’chunov, D. E. Finitely axiomatizable Boolean algebras with distinguished ideals. (Russian) Zbl 0647.03026 Algebra Logika 26, No. 4, 435-455 (1987). Reviewer: S.R.Kogalovskij MSC: 03C35 06E99 PDFBibTeX XMLCite \textit{D. E. Pal'chunov}, Algebra Logika 26, No. 4, 435--455 (1987; Zbl 0647.03026) Full Text: EuDML
Pal’chunov, D. E. Countably-categorical Boolean algebras with distinguished ideals. (English) Zbl 0647.03025 Stud. Log. 46, 121-135 (1987). Reviewer: S.R.Kogalovskij MSC: 03C35 06E99 PDFBibTeX XMLCite \textit{D. E. Pal'chunov}, Stud. Log. 46, 121--135 (1987; Zbl 0647.03025) Full Text: DOI
Vazhenin, Yu. M. Algorithmic problems and the hierarchies of first order languages. (Russian) Zbl 0647.03006 Algebra Logika 26, No. 4, 419-434 (1987). Reviewer: N.Both MSC: 03B25 03D55 PDFBibTeX XMLCite \textit{Yu. M. Vazhenin}, Algebra Logika 26, No. 4, 419--434 (1987; Zbl 0647.03006) Full Text: EuDML
Gerla, Giangiacomo Decidability, partial decidability and sharpness relation for L-subsets. (English) Zbl 0645.03053 Stud. Log. 46, 227-238 (1987). Reviewer: S.Gottwald MSC: 03E72 03D25 03B25 PDFBibTeX XMLCite \textit{G. Gerla}, Stud. Log. 46, 227--238 (1987; Zbl 0645.03053) Full Text: DOI
Parigot, Michel Automata, games, and positive monadic theories of trees. (English) Zbl 0645.03037 Foundations of software technology and theoretical computer science, Proc. 7th Conf., Pune/India 1987, Lect. Notes Comput. Sci. 287, 44-57 (1987). Reviewer: Phan Dinh Dieu MSC: 03D05 03D15 03B25 PDFBibTeX XML
Anisimov, A. V.; Oleshchuk, V. A. Stable finite automata mappings and Church-Rosser systems. (English) Zbl 0645.03035 Fundamentals of computation theory, Proc. Int. Conf., Kazan/USSR 1987, Lect. Notes Comput. Sci. 278, 30-33 (1987). Reviewer: A.V.Anisimov MSC: 03D03 03D05 20M05 20F10 20M35 PDFBibTeX XML
Courcelle, B. An axiomatic definition of context-free rewriting and its application to NLC graph grammars. (English) Zbl 0644.68095 Theor. Comput. Sci. 55, 141-181 (1987). Reviewer: A.V.Anisimov MSC: 68Q45 68R10 PDFBibTeX XMLCite \textit{B. Courcelle}, Theor. Comput. Sci. 55, 141--181 (1987; Zbl 0644.68095) Full Text: DOI
Martinez, Juan Carlos Decision procedure for a class of \((L_{\omega _ 1\omega})_ t\)-types of \(T_ 3\) spaces. (English) Zbl 0644.03022 Notre Dame J. Formal Logic 28, 284-290 (1987). Reviewer: J.Flum MSC: 03C99 03B25 03C75 PDFBibTeX XMLCite \textit{J. C. Martinez}, Notre Dame J. Formal Logic 28, 284--290 (1987; Zbl 0644.03022) Full Text: DOI
Ronchi Della Rocca, Simona A unification semi-algorithm for intersection type schemes. (English) Zbl 0644.03008 TAPSOFT ’87, Proc. Int. Conf. Software development, Pisa/Italy 1987, Vol. 1: Trees in algebra and programming, Lect. Notes Comput. Sci. 249, 37-51 (1987). Reviewer: G.Ciobanu MSC: 03B40 03B25 68Q65 PDFBibTeX XML
Lange, Steffen A decidability problem of Church-Rosser specifications for program synthesis. (English) Zbl 0643.68007 Analogical and inductive inference, Proc. Int. Workshop, Wendisch- Rietz/GDR 1986, Lect. Notes Comput. Sci. 265, 105-124 (1987). MSC: 68N01 03B25 68W30 68T05 PDFBibTeX XML
Forster, T. E. Term models for weak set theories with a universal set. (English) Zbl 0643.03039 J. Symb. Log. 52, 374-387 (1987). Reviewer: V.Ya.Kreinovich MSC: 03E70 PDFBibTeX XMLCite \textit{T. E. Forster}, J. Symb. Log. 52, 374--387 (1987; Zbl 0643.03039) Full Text: DOI
Sturmfels, Bernd On the decidability of diophantine problems in combinatorial geometry. (English) Zbl 0643.03008 Bull. Am. Math. Soc., New Ser. 17, 121-124 (1987). Reviewer: F.Hering MSC: 03B25 52A10 52C07 52A37 52C17 PDFBibTeX XMLCite \textit{B. Sturmfels}, Bull. Am. Math. Soc., New Ser. 17, 121--124 (1987; Zbl 0643.03008) Full Text: DOI
Buszkowski, Wojciech Solvable problems for classical categorial grammars. (English) Zbl 0642.03022 Bull. Pol. Acad. Sci., Math. 35, No. 1-10, 373-382 (1987). MSC: 03B99 03B25 03D05 68Q45 PDFBibTeX XMLCite \textit{W. Buszkowski}, Bull. Pol. Acad. Sci., Math. 35, No. 1--10, 373--382 (1987; Zbl 0642.03022)
Culik, Karel II; Karhumäki, Juhani The decidability of the DT0L sequence equivalence problem and related decision problems. (English) Zbl 0641.68117 The very knowledge of coding, Stud. Hon. Aimo Tietäväinen Occas. 50th Birthday, 43-54 (1987). MSC: 68Q45 68Q42 PDFBibTeX XML
Tung, S. P. Computational complexities of diophantine equations with parameters. (English) Zbl 0641.03009 J. Algorithms 8, 324-336 (1987). Reviewer: R.Rumely MSC: 03B25 03D15 11D72 11D99 11U05 PDFBibTeX XMLCite \textit{S. P. Tung}, J. Algorithms 8, 324--336 (1987; Zbl 0641.03009) Full Text: DOI
Gilula, M. M.; Stolboushkin, A. P.; Shvarts, G. F.; Shvachko, K. V. Some algorithmic questions in the theory of relational databases. (Russian) Zbl 0639.68123 Vopr. Kibern., Mosk. 125, 81-91 (1987). Reviewer: A.P.Stolboushkin MSC: 68P20 03B25 03C13 03B10 PDFBibTeX XMLCite \textit{M. M. Gilula} et al., Vopr. Kibern., Mosk. 125, 81--91 (1987; Zbl 0639.68123)
Slaby, Wolfgang A. Segment translation systems. (English) Zbl 0639.68083 Computation theory and logic, D. Rödding Occas. 50th Anniv. Birth, Lect. Notes Comput. Sci. 270, 382-390 (1987). Reviewer: W.A.Slaby MSC: 68T50 68Q45 PDFBibTeX XML
Neumüller, Imre The invertibility of tree transducers. (English) Zbl 0639.68073 Acta Cybern. 8, No. 1, 63-78 (1987). Reviewer: M.Steinby MSC: 68Q45 PDFBibTeX XMLCite \textit{I. Neumüller}, Acta Cybern. 8, No. 1, 63--78 (1987; Zbl 0639.68073)
Pałasiński, Marek No non-trivial quasivariety of BCK-algebras has decidable first order theory. (English) Zbl 0639.03064 Stud. Log. 46, 343-345 (1987). Reviewer: M.Pałasiński MSC: 03G25 03B25 PDFBibTeX XMLCite \textit{M. Pałasiński}, Stud. Log. 46, 343--345 (1987; Zbl 0639.03064) Full Text: DOI
Mundici, Daniele The Turing complexity of AF C *-algebras with lattice-ordered \(K_ 0\). (English) Zbl 0639.03043 Computation theory and logic, D. Rödding Occas. 50th Anniv. Birth, Lect. Notes Comput. Sci. 270, 256-264 (1987). Reviewer: H.Schröder MSC: 03D15 03B50 46L05 06F15 03B25 PDFBibTeX XML
Pheidas, Thanases An undecidability result for power series rings of positive characteristic. (English) Zbl 0639.03009 Proc. Am. Math. Soc. 99, 364-366 (1987). Reviewer: R.Rumely MSC: 03B25 11U05 12L05 03D35 13F25 13L05 PDFBibTeX XMLCite \textit{T. Pheidas}, Proc. Am. Math. Soc. 99, 364--366 (1987; Zbl 0639.03009) Full Text: DOI
Ryšlinková, Jana Church-Rosser property and decidability of monadic theories of unary algebras. (English) Zbl 0639.03008 RAIRO, Inf. Théor. Appl. 21, 323-329 (1987). Reviewer: M.Tetruašvili MSC: 03B25 08A60 PDFBibTeX XMLCite \textit{J. Ryšlinková}, RAIRO, Inform. Théor. Appl. 21, 323--329 (1987; Zbl 0639.03008) Full Text: DOI EuDML
Bürckert, Hans-Jürgen; Herold, Alexander; Schmidt-Schauß, Manfred On equational theories, unification and decidability. (English) Zbl 0638.68102 Rewriting techniques and applications, Proc. 2nd Int. Conf., Bordeaux/France 1987, Lect. Notes Comput. Sci. 256, 204-215 (1987). MSC: 68T15 PDFBibTeX XML
Book, Ronald V. Thue systems as rewriting systems. (English) Zbl 0638.68091 J. Symb. Comput. 3, 39-68 (1987). Reviewer: S.P.Yukna MSC: 68Q45 68T15 03D03 03D15 68Q25 PDFBibTeX XMLCite \textit{R. V. Book}, J. Symb. Comput. 3, 39--68 (1987; Zbl 0638.68091) Full Text: DOI
Turakainen, Paavo The equivalence of deterministic gsm replications on Q-rational languages is decidable. (English) Zbl 0638.68088 Math. Syst. Theory 20, No. 4, 273-282 (1987). MSC: 68Q45 PDFBibTeX XMLCite \textit{P. Turakainen}, Math. Syst. Theory 20, No. 4, 273--282 (1987; Zbl 0638.68088) Full Text: DOI
Németi, I. Decidability of relation algebras with weakened associativity. (English) Zbl 0638.03061 Proc. Am. Math. Soc. 100, 340-344 (1987). Reviewer: C.S.Kalfa MSC: 03G15 03B25 PDFBibTeX XMLCite \textit{I. Németi}, Proc. Am. Math. Soc. 100, 340--344 (1987; Zbl 0638.03061) Full Text: DOI
Burrieza, A.; León, Juan C. Modal trees: Correction to a decision procedure for S5 (and T). (English) Zbl 0638.03015 Notre Dame J. Formal Logic 28, 385-391 (1987). MSC: 03B45 03B25 PDFBibTeX XMLCite \textit{A. Burrieza} and \textit{J. C. León}, Notre Dame J. Formal Logic 28, 385--391 (1987; Zbl 0638.03015) Full Text: DOI
Németi, I. On varieties of cylindric algebras with applications to logic. (English) Zbl 0637.03062 Ann. Pure Appl. Logic 36, 235-277 (1987). Reviewer: J.Monk MSC: 03G15 03D15 03B25 03D35 PDFBibTeX XMLCite \textit{I. Németi}, Ann. Pure Appl. Logic 36, 235--277 (1987; Zbl 0637.03062) Full Text: DOI
Anisimov, A. V.; Oleshchuk, V. A. Church-Rosser systems with respect to the equivalence module. (Russian. English summary) Zbl 0637.03032 Dokl. Akad. Nauk Ukr. SSR, Ser. A 1987, No. 9, 71-74 (1987). Reviewer: S.P.Jukna MSC: 03D03 PDFBibTeX XMLCite \textit{A. V. Anisimov} and \textit{V. A. Oleshchuk}, Dokl. Akad. Nauk Ukr. SSR, Ser. A 1987, No. 9, 71--74 (1987; Zbl 0637.03032)
Idziak, Paweł M. Undecidability of free pseudo-complemented semilattices. (English) Zbl 0637.03009 Publ. Res. Inst. Math. Sci. 23, No. 3, 559-564 (1987). MSC: 03B25 06A12 08B05 03D35 08B20 PDFBibTeX XMLCite \textit{P. M. Idziak}, Publ. Res. Inst. Math. Sci. 23, No. 3, 559--564 (1987; Zbl 0637.03009) Full Text: DOI
Heindorf, Lutz A decidability proof for the theory of countable Boolean algebras in the language with quantification over ideals. (English) Zbl 0637.03008 Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 93, 34-45 (1987). Reviewer: J.M.Plotkin MSC: 03B25 06E99 PDFBibTeX XMLCite \textit{L. Heindorf}, Seminarber., Humboldt-Univ. Berlin, Sekt. Math. 93, 34--45 (1987; Zbl 0637.03008)
Benninghofen, B.; Kemmerich, S.; Richter, M. M. [Otto, F.] Systems of reductions. (English) Zbl 0636.68027 Lecture Notes in Computer Science, 277. Berlin etc.: Springer-Verlag. X, 265 p.; DM 40.50 (1987). Reviewer: J.Zlatuska MSC: 68Q65 08A50 20F10 20M35 03D60 68Q25 68Q45 68T15 68-02 03B25 PDFBibTeX XML
Arfi, Mustapha Polynomial operations on rational languages. (English) Zbl 0635.68078 STACS 87, Theoretical aspects of computer science, Proc. 4th annu. Symp., Passau/FRG 1987, Lect. Notes Comput. Sci. 247, 198-206 (1987). MSC: 68Q45 20M35 03B25 PDFBibTeX XML
Baeten, J. C. M.; Bergstra, J. A.; Klop, J. W. Decidability of bisimulation equivalence for processes generating context-free languages. (English) Zbl 0635.68014 PARLE, Parallel architectures and languages Europe, Proc. Conf., Eindhoven/Neth. 1987, Vol. 2, Lect. Notes Comput. Sci. 259, 94-111 (1987). Reviewer: N.Huhro MSC: 68N25 68Q55 68Q45 PDFBibTeX XML
Aalbersberg, Ijsbrand Jan; Hoogeboom, Hendrik Jan Decision problems for regular trace languages. (English) Zbl 0635.68013 Automata, languages and programming, Proc. 14th Int. Colloq., Karlsruhe/FRG 1987, Lect. Notes Comput. Sci. 267, 250-259 (1987). Reviewer: H.J.Schneider MSC: 68N25 68Q45 03D60 68Q85 PDFBibTeX XML
Garncarek, Eugenia; Piróg-Rzepecka, Krystyna A decision procedure for expressions that lose their sense. (Polish) Zbl 0635.03021 Zesz. Nauk. Wyższ. Szk. Pedagog. Opolu, Mat. 24, 11-25 (1987). MSC: 03B50 03B25 03B60 PDFBibTeX XMLCite \textit{E. Garncarek} and \textit{K. Piróg-Rzepecka}, Zesz. Nauk. Wyższ. Szk. Pedagog. Opolu, Mat. 24, 11--25 (1987; Zbl 0635.03021)
Courcelle, Bruno; Gallier, Jean H. Decidable subcases of the equivalence problem for recursive program schemes. (English) Zbl 0634.68017 RAIRO, Inf. Théor. Appl. 21, 245-286 (1987). Reviewer: R.Horsch MSC: 68Q65 68Q60 PDFBibTeX XMLCite \textit{B. Courcelle} and \textit{J. H. Gallier}, RAIRO, Inform. Théor. Appl. 21, 245--286 (1987; Zbl 0634.68017) Full Text: DOI EuDML
Fischer, Michael J.; Immerman, Neil Interpreting logics of knowledge in propositional dynamic logic. (English) Zbl 0634.03012 Inf. Process. Lett. 25, 175-181 (1987). Reviewer: J.Sefránek MSC: 03B45 68N25 68T99 03B70 03B25 68Q25 03D15 PDFBibTeX XMLCite \textit{M. J. Fischer} and \textit{N. Immerman}, Inf. Process. Lett. 25, 175--181 (1987; Zbl 0634.03012) Full Text: DOI
Cantone, D.; Ferro, A.; Schwartz, J. T. Decision procedures for elementary sublanguages of set theory. V. Multilevel syllogistic extended by the general union operator. (English) Zbl 0634.03008 J. Comput. Syst. Sci. 34, 1-18 (1987). Reviewer: J.M.Plotkin MSC: 03B25 03E99 03B30 PDFBibTeX XMLCite \textit{D. Cantone} et al., J. Comput. Syst. Sci. 34, 1--18 (1987; Zbl 0634.03008) Full Text: DOI
Cherkasova, Ludmila A.; Kotov, Vadim E. The undecidability of propositional temporal logic for Petri nets. (English) Zbl 0633.03018 Comput. Artif. Intell. 6, 123-130 (1987). Reviewer: J.Sefránek MSC: 03B70 68Q85 03B25 03B45 68Q65 68Q60 PDFBibTeX XMLCite \textit{L. A. Cherkasova} and \textit{V. E. Kotov}, Comput. Artif. Intell. 6, 123--130 (1987; Zbl 0633.03018)
Dulatova, Z. A. Theory of Boolean algebras with a locally finite group of automorphisms. (English. Russian original) Zbl 0633.03003 Sib. Math. J. 28, No. 3, 424-425 (1987); translation from Sib. Mat. Zh. 28, No. 3(163), 89-90 (1987). Reviewer: L.Esakia MSC: 03B25 03C65 06E99 PDFBibTeX XMLCite \textit{Z. A. Dulatova}, Sib. Math. J. 28, No. 3, 424--425 (1987; Zbl 0633.03003); translation from Sib. Mat. Zh. 28, No. 3(163), 89--90 (1987) 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
Müller, Gert H. (ed.); Lenski, W. (ed.); Ebbinghaus, H.-D. (ed.) \(\Omega\)-bibliography of mathematical logic. In collaboration with Wolfgang Lenski. Volume III: Model theory. Edited by Heinz-Dieter Ebbinghaus. (English) Zbl 0632.03004 Perspectives in Mathematical Logic. Berlin etc.: Springer-Verlag. XLV, 617 p.; 6-vol.-set: DM 1.940.00 (1987). Reviewer: P.Hájek MSC: 03-00 00A15 03Cxx 03B25 03H15 PDFBibTeX XML
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
Grigor’ev, D. Yu. The complexity of the decision problem for the first order theory of algebraically closed fields. (English) Zbl 0631.03006 Math. USSR, Izv. 29, 459-475 (1987). MSC: 03B25 12D05 03C10 03D15 PDFBibTeX XMLCite \textit{D. Yu. Grigor'ev}, Math. USSR, Izv. 29, 459--475 (1987; Zbl 0631.03006) Full Text: DOI
Carstensen, Heino Decidability questions for fairness in Petri nets. (English) Zbl 0629.68063 STACS 87, Theoretical aspects of computer science, Proc. 4th annu. Symp., Passau/FRG 1987, Lect. Notes Comput. Sci. 247, 396-407 (1987). Reviewer: M.Jantzen MSC: 68Q85 68Q45 PDFBibTeX XML
Läuchli, Hans; Savioz, Christian Monadic second order definable relations on the binary tree. (English) Zbl 0628.03005 J. Symb. Log. 52, 219-226 (1987). Reviewer: N.Both MSC: 03B25 03D05 03C40 PDFBibTeX XMLCite \textit{H. Läuchli} and \textit{C. Savioz}, J. Symb. Log. 52, 219--226 (1987; Zbl 0628.03005) Full Text: DOI
Pin, J. E. On the languages accepted by finite reversible automata. (English) Zbl 0627.68069 Automata, languages and programming, Proc. 14th Int. Colloq., Karlsruhe/FRG 1987, Lect. Notes Comput. Sci. 267, 237-249 (1987). MSC: 68Q45 20M05 PDFBibTeX XML
Bryll, Grzegorz; Hałkowska, Katarzyna Ł-decidability of fragmentary Słupecki’s systems. (Polish. English summary) Zbl 0626.03008 Zesz. Nauk. Wyższ. Szk. Pedagog. Opolu, Mat. 24, 5-10 (1987). MSC: 03B25 03B50 PDFBibTeX XMLCite \textit{G. Bryll} and \textit{K. Hałkowska}, Zesz. Nauk. Wyższ. Szk. Pedagog. Opolu, Mat. 24, 5--10 (1987; Zbl 0626.03008)
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
Giambrone, Steve; Kron, Aleksandar Four relevant Gentzen systems. (English) Zbl 0625.03008 Stud. Log. 46, 55-71 (1987). MSC: 03B45 03B25 03F05 03F07 03F20 PDFBibTeX XMLCite \textit{S. Giambrone} and \textit{A. Kron}, Stud. Log. 46, 55--71 (1987; Zbl 0625.03008) Full Text: DOI
Rybakov, V. V. Decidability of admissibility in the modal system Grz and in intuitionistic logic. (English. Russian original) Zbl 0624.03009 Math. USSR, Izv. 28, 589-608 (1987); translation from Izv. Akad. Nauk SSSR, Ser. Mat. 50, No. 3, 598-616 (1986). MSC: 03B25 03B45 03B20 PDFBibTeX XMLCite \textit{V. V. Rybakov}, Math. USSR, Izv. 28, 589--608 (1987; Zbl 0624.03009); translation from Izv. Akad. Nauk SSSR, Ser. Mat. 50, No. 3, 598--616 (1986) Full Text: DOI
Tetruashvili, M. R. The complexity of the solution of the truth problem for an elementary sublanguage of quantifier-free set theory. (Russian. English summary) Zbl 0624.03008 Soobshch. Akad. Nauk Gruz. SSR 126, 245-247 (1987). MSC: 03B25 03E99 03D10 03D15 PDFBibTeX XMLCite \textit{M. R. Tetruashvili}, Soobshch. Akad. Nauk Gruz. SSR 126, 245--247 (1987; Zbl 0624.03008)
Rhodes, John New techniques in global semigroup theory. (English) Zbl 0622.20049 Semigroups and their applications, Proc. Int. Conf., Chico/Calif. 1986, 169-181 (1987). Reviewer: V.Koubek MSC: 20M07 20M05 03D35 03D60 08C15 PDFBibTeX XML
Sistla, A. Prasad; Vardi, Moshe Y.; Wolper, Pierre The complementation problem for Büchi automata with applications to temporal logic. (English) Zbl 0613.03015 Theor. Comput. Sci. 49, 217-237 (1987). MSC: 03D05 03B70 03B25 68Q65 03D15 03B45 PDFBibTeX XMLCite \textit{A. P. Sistla} et al., Theor. Comput. Sci. 49, 217--237 (1987; Zbl 0613.03015) Full Text: DOI
Došen, Kosta A note on Gentzen’s decision procedure for intuitionistic propositional logic. (English) Zbl 0612.03010 Z. Math. Logik Grundlagen Math. 33, 453-456 (1987). MSC: 03B25 03F07 PDFBibTeX XMLCite \textit{K. Došen}, Z. Math. Logik Grundlagen Math. 33, 453--456 (1987; Zbl 0612.03010) Full Text: DOI
Deutsch, Michael Eine Verschärfung eines Satzes von Kostyrko zur Reduktionstheorie mit einer Anwendung auf die spektrale Darstellung von Prädikaten. (German) Zbl 0609.03001 Z. Math. Logik Grundlagen Math. 33, 347-358 (1987). MSC: 03B25 03B10 PDFBibTeX XMLCite \textit{M. Deutsch}, Z. Math. Logik Grundlagen Math. 33, 347--358 (1987; Zbl 0609.03001) Full Text: DOI
Burris, Stanley The model completion of the class of L-structures. (English) Zbl 0608.03011 Z. Math. Logik Grundlagen Math. 33, 313-314 (1987). MSC: 03C52 03B25 PDFBibTeX XMLCite \textit{S. Burris}, Z. Math. Logik Grundlagen Math. 33, 313--314 (1987; Zbl 0608.03011) Full Text: DOI
Deutsch, Michael Eine Bemerkung zum Reduktionstyp \(\forall ^ 3\exists ^{\infty}(0,1)\). (German) Zbl 0608.03003 Z. Math. Logik Grundlagen Math. 33, 179-186 (1987). MSC: 03B25 PDFBibTeX XMLCite \textit{M. Deutsch}, Z. Math. Logik Grundlagen Math. 33, 179--186 (1987; Zbl 0608.03003) Full Text: DOI
Biacino, Loredana; Gerla, Giangiacomo Recursively enumerable L-sets. (English) Zbl 0597.03026 Z. Math. Logik Grundlagen Math. 33, 107-113 (1987). MSC: 03D25 03E72 03B52 03B25 PDFBibTeX XMLCite \textit{L. Biacino} and \textit{G. Gerla}, Z. Math. Logik Grundlagen Math. 33, 107--113 (1987; Zbl 0597.03026) Full Text: DOI
Cantone, Domenico; Ferro, Alfredo; Sorace, Giuseppe; Micale, Biagio Decision procedures for elementary sublanguages of set theory. IV: Formulae involving a rank operator or one occurrence of \(\Sigma (x)=\{\{y\}|\) y\(\in x\}\). (English) Zbl 0595.03007 Commun. Pure Appl. Math. 40, No. 1, 37-77 (1987). MSC: 03B25 03E99 PDFBibTeX XMLCite \textit{D. Cantone} et al., Commun. Pure Appl. Math. 40, No. 1, 37--77 (1987; Zbl 0595.03007) Full Text: DOI
Kapur, Deepak; Narendran, Paliath; Zhang, Hantao On sufficient-completeness and related properties of term rewriting systems. (English) Zbl 0594.68035 Acta Inf. 24, 395-415 (1987). MSC: 68Q65 PDFBibTeX XMLCite \textit{D. Kapur} et al., Acta Inf. 24, 395--415 (1987; Zbl 0594.68035) Full Text: DOI
Wood, Derick Theory of computation. (English) Zbl 0734.68001 New York etc.: John Wiley & Sons Ltd. XVIII, 558 p. (1987). MSC: 68-01 68Q45 68Q42 68Q05 68Q25 PDFBibTeX XMLCite \textit{D. Wood}, Theory of computation. New York etc.: John Wiley \&| Sons Ltd. (1987; Zbl 0734.68001)