Order:
  1.  12
    Complete Local Rings as Domains.V. Stoltenberg-Hansen & J. V. Tucker - 1988 - Journal of Symbolic Logic 53 (2):603-624.
  2.  61
    J. C. Shepherdson. Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory. Harvey Friedman's Research on the Foundations of Mathematics, Edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in Logic and the Foundations of Mathematics, Vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, Pp. 285–308. - J. C. Shepherdson. Computational Complexity of Real Functions. Harvey Friedman's Research on the Foundations of Mathematics, Edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in Logic and the Foundations of Mathematics, Vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, Pp. 309–315. - A. J. Kfoury. The Pebble Game and Logics of Programs. Harvey Friedman's Research on the Foundations of Mathematics, Edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in Logic and the Foundations of Mathematics, Vol. 117, North-Holland, Amsterdam, New York, An. [REVIEW]J. V. Tucker - 1990 - Journal of Symbolic Logic 55 (2):876-878.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  11
    Abrahamson, KA, Downey, RG and Fellows, MR.R. Banacb, H. Barendregt, J. A. Bergstra, J. V. Tucker, J. Brendle, I. Moerdijk, E. Palmgren, J. I. Seiferas, A. R. Meyer & J. Terlouw - 1995 - Annals of Pure and Applied Logic 73 (1):327.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  24
    Computability and the Algebra of Fields: Some Affine Constructions.J. V. Tucker - 1980 - Journal of Symbolic Logic 45 (1):103-120.
  5.  13
    Many-Sorted Logic and its Applications.K. Meinke & J. V. Tucker - 1993 - Wiley.
    Prominent experts present papers which discuss problems regarding this subject. Coverage includes case studies in the translation of logics for second-order and propositional dynamic logic; many-sorted algebras and equational logic; logical foundations of artificial intelligence along with a variety of methods that exist to encode information; program verification techniques such as Floyd-Hoare, intermittent assertion and temporal logic of programs.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  15
    The Data Type Variety of Stack Algebras.J. A. Bergstra & J. V. Tucker - 1995 - Annals of Pure and Applied Logic 73 (1):11-36.
    We define and study the class of all stack algebras as the class of all minimal algebras in a variety defined by an infinite recursively enumerable set of equations. Among a number of results, we show that the initial model of the variety is computable, that its equational theory is decidable, but that its equational deduction problem is undecidable. We show that it cannot be finitely axiomatised by equations, but it can be finitely axiomatised by equations with a hidden sort (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  4
    [Omnibus Review].J. V. Tucker - 1990 - Journal of Symbolic Logic 55 (2):876-878.