Publisher： Cambridge University Press
E-ISSN： 1943-5886|48|4|1140-1144
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.48, Iss.4, 1983-12, pp. : 1140-1144
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The completeness of a predicate-functor logic
The Journal of Symbolic Logic, Vol. 50, Iss. 4, 1985-12 ,pp. :
Access to resources
Recommend
An intuitiomstic completeness theorem for intuitionistic predicate logic
The Journal of Symbolic Logic, Vol. 41, Iss. 1, 1976-03 ,pp. :
On the complexity of Gödel's proof predicate
The Journal of Symbolic Logic, Vol. 75, Iss. 1, 2010-03 ,pp. :
Provability in predicate product logic
Archive for Mathematical Logic, Vol. 46, Iss. 5-6, 2007-07 ,pp. :
A reduction theorem for predicate logic
The Journal of Symbolic Logic, Vol. 37, Iss. 2, 1972-06 ,pp. :