Generalized quantifiers and pebble games on finite structures
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1086490
- Games in finite model theory
- On Some Applications of Games for Härtig Quantifier
- scientific article; zbMATH DE number 1424046
- Logic and games on automatic structures. Playing with quantifiers and decompositions
- GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC
- Game semantics, quantifiers and logical omniscience
- scientific article; zbMATH DE number 1163933
- Pebble games and subroutines in least fixed point logic
- Games in algebraic logic: axiomatisations and beyond
Cites work
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 3819693 (Why is no real title available?)
- scientific article; zbMATH DE number 3941493 (Why is no real title available?)
- scientific article; zbMATH DE number 3981154 (Why is no real title available?)
- scientific article; zbMATH DE number 3984616 (Why is no real title available?)
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 3675868 (Why is no real title available?)
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 3528202 (Why is no real title available?)
- scientific article; zbMATH DE number 3600018 (Why is no real title available?)
- scientific article; zbMATH DE number 1354171 (Why is no real title available?)
- scientific article; zbMATH DE number 1028806 (Why is no real title available?)
- An observation on time-storage trade off
- Definability with bounded number of bound variables
- Elementary induction on abstract structures
- Fixed-point extensions of first-order logic
- Generalized Ehrenfeucht games
- Inductive definitions over finite structures
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Logic with the quantifier “there exist uncountably many”
- Logical hierarchies in PTIME
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Monadic generalized spectra
- Monotone versus positive
- On Extensions of Elementary Logic
- On Moschovakis closure ordinals
- On a generalization of quantifiers
- Questions about quantifiers
- Reachability is harder for directed than for undirected finite graphs
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
- The Härtig quantifier: a survey
- Upper and lower bounds for first order expressibility
Cited in
(27)- Lower bounds for invariant queries in logics with counting.
- GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC
- On vectorizations of unary generalized quantifiers
- An extension of the Ehrenfeucht-Fraïssé game for first order logics augmented with Lindström quantifiers
- Adding for-loops to first-order logic
- Relativized logspace and generalized quantifiers over finite ordered structures
- Counting modulo quantifiers on finite structures
- Notions of locality and their logical characterizations over finite models
- Infinitary logic for computer science
- Game comonads \& generalised quantifiers
- The hierarchy theorem for generalized quantifiers
- Dependence logic with generalized quantifiers: axiomatizations
- Game-based notions of locality over finite models
- On the expressive power of monotone natural language quantifiers over finite models
- Pebble games and subroutines in least fixed point logic
- scientific article; zbMATH DE number 1424046 (Why is no real title available?)
- Games and Lindström theorems
- On probabilistic elimination of generalized quantifiers
- On the complexities of consistency checking for restricted UML class diagrams
- A dichotomy in classifying quantifiers for finite models
- Syllogistic logic with cardinality comparisons
- Semantic restrictions over second-order logic
- scientific article; zbMATH DE number 991699 (Why is no real title available?)
- Almost Everywhere Equivalence of Logics in Finite Model Theory
- Sameness
- scientific article; zbMATH DE number 1086490 (Why is no real title available?)
- On the expressive power of counting
This page was built for publication: Generalized quantifiers and pebble games on finite structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892941)
