Natural limitations of algorithmic procedures in logic

Daniele Mundici

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti (1980)

  • Volume: 69, Issue: 3-4, page 101-105
  • ISSN: 0392-7881

How to cite

top

Mundici, Daniele. "Natural limitations of algorithmic procedures in logic." Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti 69.3-4 (1980): 101-105. <http://eudml.org/doc/289002>.

@article{Mundici1980,
author = {Mundici, Daniele},
journal = {Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti},
language = {eng},
month = {9},
number = {3-4},
pages = {101-105},
publisher = {Accademia Nazionale dei Lincei},
title = {Natural limitations of algorithmic procedures in logic},
url = {http://eudml.org/doc/289002},
volume = {69},
year = {1980},
}

TY - JOUR
AU - Mundici, Daniele
TI - Natural limitations of algorithmic procedures in logic
JO - Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti
DA - 1980/9//
PB - Accademia Nazionale dei Lincei
VL - 69
IS - 3-4
SP - 101
EP - 105
LA - eng
UR - http://eudml.org/doc/289002
ER -

References

top
  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D. (1974) - The design and analysis of computer algorithms, Addison-Wesley, Mass. Zbl0326.68005MR413592
  2. Bell, J.L., Machover, M. (1977) - A course in mathematical logic, North-Holland, Amsterdam. Zbl0359.02001MR472455
  3. Chang, C.C., Keisler, H.J. (1977) - Model theory, second ed., North-Holland, Amsterdam. MR532927
  4. Ferrante, J., Rackoff, C.W. (1979) - The computational complexity of logical theories, Lecture Notes in Math., 718, Springer, Berlin. Zbl0404.03028MR537764
  5. Fischer, M.J., Rabin, M.O. (1974) - Super-exponential complexity of Presburger arithmetic, «SIAM-AMS Proceedings», 7, 27-41. Zbl0319.68024MR366646
  6. Gudder, S.P. (1979) - Stochastic methods in quantum mechanics, North-Holland, Amsterdam. Zbl0439.46047MR543489
  7. 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
  8. Monk, J.D. (1976) - Mathematical logic, Springer, Berlin. Zbl0354.02002MR465767
  9. Mundici, D. (1982) - Compactness — JEP in any logic, «Fund. Math.», to appear, MR716223
  10. Mundici, D. (1981) - Robinson's consistency theorem in soft model theory, «Trans. AMS», 263, 231-241. Zbl0519.03031MR590421DOI10.2307/1998653
  11. Mundici, D. - Complexity of Craig's interpolation, «J. Symb. Logic», to appear. 
  12. Mundici, D. - Impracticable theorem-proving Turing machines, to appear. 
  13. Mundici, D. - Natural limitations of decision procedures for arithmetic with bounded quantifiers, to appear. 
  14. Rabin, M.O. (1977) - Decidable theories, in: Handbook of math. logic (editor J. Barwise) North-Holland, Amsterdam, 595-630. 
  15. Savage, J.E. (1976) - The complexity of computing, Wiley, New York. 
  16. Stockmeyer, L.J. (1974) - The complexity of decision problems in automata theory and logic, Proj. MAC Tech. Report, 133. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.