The decision problem for the logic of predicates and of operations-Reference-Cited by-同舟云学术

The decision problem for the logic of predicates and of operations

Published:1969-05 Issue:3 Volume:8 Page:160-174
ISSN:0002-5232
Container-title:Algebra and Logic
language:en
Short-container-title:Algebr Logic

Author:

Gurevich Yu. Sh.

Publisher

Springer Science and Business Media LLC

Subject

Logic,Analysis

Link

http://link.springer.com/content/pdf/10.1007/BF02306690.pdf

Reference9 articles.

1. W. Ackermann, Solvable Cases of the Decision Problem, Amsterdam (1954).

2. Yu. Sh. Gurevich, “On effective recognition of well formedness of formulas in ‘UIP’,” Algebra i Logika,5, No. 2, 25–55 (1966).

3. Yu. Sh. Gurevich, “Formulas with one ∀ ,” in: “In Memory of A. I. Mal'tsev” (in press).

4. V. A. Livshits, “Some classes of reduction and undecidable theories,” Notes of the Science Seminars of the Mathematics Department of the Steklov Mathematical Institute, Leningrad,4 (1967).

5. M. H. Loeb, “Decidability of the monadic predicate calculus with unary function symbols,” J. Symbolic Logic,32, No. 4, 563 (1967).

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Impact of Self-Construals and Thinking Styles on Business and Management Practices: A Comparison of East Asia and North America;Advances in Theory and Practice of Emerging Markets;2022

2. Parameterized Complexity of Some Prefix-Vocabulary Fragments of First-Order Logic;Logic, Language, Information, and Computation;2018

3. Truthful Monadic Abstractions;Automated Reasoning;2012

4. Solving First-Order Constraints over the Monadic Class;Lecture Notes in Computer Science;2005

5. Chapter 9 Constructive models of finitely axiomatizable theories;Handbook of Recursive Mathematics - Volume 1: Recursive Model Theory;1998