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

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

On the expressive power of first-order boolean functions in PCF

By Pucella  

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 543-567

Elsevier

Access to resources Recommend Favorite

From first-order logic to automated word generation for Lyee

By Amon B.   Ekenberg L.   Johannesson P.   Munguanaze M.   Njabili U.   Manka Tesha R.  

Knowledge-Based Systems, Vol. 16, Iss. 7, 2003-11 ,pp. : 413-429

Elsevier

Access to resources Recommend Favorite

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

By Lahav Ori   Avron Arnon  

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

Oxford University Press

Access to resources Recommend Favorite