Back to Results
First PageMeta Content
Theoretical computer science / Finite model theory / FO / Age / Interpretation / Logical connective / Model theory / Logic / Metalogic


Annals of Pure and Applied Logic[removed]–30 www.elsevier.com/locate/apal Game-based notions of locality over finite models! Marcelo Arenas a,∗ , Pablo Barcel´o b , Leonid Libkin c a Department of Computer Scien
Add to Reading List

Document Date: 2013-04-26 05:57:02

Open Document

File Size: 806,85 KB

Share Result on Facebook

Company

Elsevier B.V. / B. / /

Country

Chile / /

/

Facility

University of Chile / University of Edinburgh / /

IndustryTerm

model-theoretic tools / e-type / low-complexity model-checking algorithms / computing / /

Organization

Laboratory for Foundations of Computer Science / School of Informatics / University of Chile / Department of Computer Science / Q. Organization / University of Edinburgh / /

Person

Pablo Barcel / Leonid Libkin / Marcelo Arenas / /

Position

Corresponding author / /

Technology

low-complexity model-checking algorithms / dom / /

URL

www.elsevier.com/locate/apal / /

SocialTag