Pebble games in model theory

DOI10.1007/3-540-63246-8_5MaRDI QIDQ4362728zbMATH OpenFDO

Authors James Lynch

Publication date 13 November 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63246-8_5

zbMATH Keywords

definabilityEhrenfeucht gamefinite model theoryrandom model theory

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Interpolation, preservation, definability (03C40)

Recommendations

• Games in finite model theory
• Generalized quantifiers and pebble games on finite structures
• Pebble games and subroutines in least fixed point logic
• Pebble games for logics with counting and rank
• Pebble games over ordered structural abstractions
• The pebbling comonad in finite model theory
• Computer Science Logic
• Pebble games, proof complexity, and time-space trade-offs
• scientific article; zbMATH DE number 991699
• Games in algebraic logic: axiomatisations and beyond

Cited in

(11)

• Generalized quantifiers and pebble games on finite structures
• Small model property reflects in games and automata
• Pebble games and subroutines in least fixed point logic
• Games in finite model theory
• Pebble games over ordered structural abstractions
• scientific article; zbMATH DE number 5853298 (Why is no real title available?)
• scientific article; zbMATH DE number 991699 (Why is no real title available?)
• Pebble games for logics with counting and rank
• PEBBLE GAMES AND LINEAR EQUATIONS
• On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
• The pebbling comonad in finite model theory

This page was built for publication: Pebble games in model theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4362728)