Propositional proof systems, the consistency of first order theories and the complexity of computations

Publisher： Cambridge University Press

E-ISSN： 1943-5886|54|3|1063-1079

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.54, Iss.3, 1989-09, pp. : 1063-1079

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Combinatorics of first order structures and propositional proof systems

By Krajíček Jan  

Archive for Mathematical Logic, Vol. 43, Iss. 4, 2004-05 ,pp. : 427-441

Springer Publishing Company

Access to resources Recommend Favorite

Systems of illative combinatory logic complete for first-order propositional and predicate calculus

By  

The Journal of Symbolic Logic, Vol. 58, Iss. 3, 1993-09 ,pp. : 769-788

Cambridge University Press

Access to resources Recommend Favorite

The relative efficiency of propositional proof systems

By  

The Journal of Symbolic Logic, Vol. 44, Iss. 1, 1979-03 ,pp. : 36-50

Cambridge University Press

Access to resources Recommend Favorite

On an interpretation of second order quantification in first order intuitionistic propositional logic

By  

The Journal of Symbolic Logic, Vol. 57, Iss. 1, 1992-03 ,pp. : 33-52

Cambridge University Press

Access to resources Recommend Favorite

Bases for first-order theories and subtheories

By  

The Journal of Symbolic Logic, Vol. 25, Iss. 2, 1960-06 ,pp. : 97-142

Cambridge University Press

Access to resources Recommend Favorite