some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

RECENTLY PUBLISHED

On the strictness of the quantifier structure hierarchy in first-order logic

  
Yuguo He

Full abstraction for fair testing in CCS (expanded version)

  
Tom Hirschowitz

Connection Matrices and the Definability of Graph Parameters

  
Tomer Kotek and Johann A. Makowsky

Constructing categories and setoids of setoids in type theory

  
Erik Palmgren and Olov Wilander

On Separation by Locally Testable and Locally Threshold Testable Languages

  
Thomas Place, Lorijn van Rooijen and Marc Zeitoun

Improving legibility of natural deduction proofs is not trivial

  
Karol Pąk




Logical Methods in Computer Science is an open-access journal, covered by Thompson ISI , SCOPUS, DBLP, Mathematical Reviews and Zentralblatt. Impact factor: 0.443. All journal content is licensed under a Creative Commons license.