Natural limitations of algorithmic procedures in logic
- Volume: 69, Issue: 3-4, page 101-105
- ISSN: 0392-7881
Access Full Article
topAbstract
topHow to cite
topReferences
top- Aho, A.V., Hopcroft, J.E., Ullman, J.D. (1974) - The design and analysis of computer algorithms, Addison-Wesley, Mass. Zbl0326.68005MR413592
- Bell, J.L., Machover, M. (1977) - A course in mathematical logic, North-Holland, Amsterdam. Zbl0359.02001MR472455
- Chang, C.C., Keisler, H.J. (1977) - Model theory, second ed., North-Holland, Amsterdam. MR532927
- Ferrante, J., Rackoff, C.W. (1979) - The computational complexity of logical theories, Lecture Notes in Math., 718, Springer, Berlin. Zbl0404.03028MR537764
- Fischer, M.J., Rabin, M.O. (1974) - Super-exponential complexity of Presburger arithmetic, «SIAM-AMS Proceedings», 7, 27-41. Zbl0319.68024MR366646
- Gudder, S.P. (1979) - Stochastic methods in quantum mechanics, North-Holland, Amsterdam. Zbl0439.46047MR543489
- Meyer, A.R. (1974) - The inherent complexity of theories of ordered sets, in: «Proc. Int. Cong. Math.», Vancouver, 2, Canadian Math. Congress, 477-482. MR441705
- Monk, J.D. (1976) - Mathematical logic, Springer, Berlin. Zbl0354.02002MR465767
- Mundici, D. (1982) - Compactness — JEP in any logic, «Fund. Math.», to appear, MR716223
- Mundici, D. (1981) - Robinson's consistency theorem in soft model theory, «Trans. AMS», 263, 231-241. Zbl0519.03031MR590421DOI10.2307/1998653
- Mundici, D. - Complexity of Craig's interpolation, «J. Symb. Logic», to appear.
- Mundici, D. - Impracticable theorem-proving Turing machines, to appear.
- Mundici, D. - Natural limitations of decision procedures for arithmetic with bounded quantifiers, to appear.
- Rabin, M.O. (1977) - Decidable theories, in: Handbook of math. logic (editor J. Barwise) North-Holland, Amsterdam, 595-630.
- Savage, J.E. (1976) - The complexity of computing, Wiley, New York.
- Stockmeyer, L.J. (1974) - The complexity of decision problems in automata theory and logic, Proj. MAC Tech. Report, 133.