A semantic proof of strong cut-admissibility for first-order Gdel logic

ISSN： 1465-363X

Source： Journal of Logic and Computation, Vol.23, Iss.1, 2013-02, pp. : 59-86

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

Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic

By Okada M.

Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. : 333-396

Elsevier

Access to resources Recommend Favorite

Design of abstract domains using first-order logic

By Marchiori E.

Theoretical Computer Science, Vol. 222, Iss. 1, 1999-07 ,pp. : 153-179

Elsevier

Access to resources Recommend Favorite

The power of the ''always'' operator in first-order temporal logic

By Kaminski M. Chung K.W.

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 271-281

Elsevier

Access to resources Recommend Favorite

Completeness of a first-order temporal logic with time-gaps

By Baaz M. Leitsch A. Zach R.

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 241-270

Elsevier

Access to resources Recommend Favorite

Proof-Guided Test Selection from First-Order Specifications with Equality

By Longuet Delphine Aiguier Marc Le Gall Pascale

Journal of Automated Reasoning, Vol. 45, Iss. 4, 2010-12 ,pp. : 437-473

Springer Publishing Company

Access to resources Recommend Favorite