scientific article; zbMATH DE number 3115890
From MaRDI portal
Publication:3230355
Cited in
(72)- Ramsey properties for classes of relational systems
- A group-theoretical invariant for elementary equivalence and its role in representations of elementary classes
- The primal framework. II: Smoothness
- Infinitary logics and 0-1 laws
- On winning strategies in Ehrenfeucht-Fraïssé games
- Counting quantifiers, successor relations, and logarithmic space
- Local properties of query languages
- The closure of monadic NP
- Forcing formulas in Fraïssé structures and classes
- Properties of existentially closed companions
- Finite information logic
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- On winning Ehrenfeucht games and monadic NP
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
- Cohen-like first order structures
- Hanf numbers for extendibility and related phenomena
- Universal decomposed Banach spaces
- Computing branching distances with quantitative games
- Succinct definitions in the first order theory of graphs
- The quantitative linear-time-branching-time spectrum
- Decomposable graphs and definitions with no quantifier alternation
- Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
- The first order definability of graphs with separators via the Ehrenfeucht game
- The probability nesting game
- An infinitary system for the least fixed-point logic restricted to finite models
- One unary function says less than two in existential second order logic
- Generalized hex and logical characterizations of polynomial space
- The Ehrenfeucht-Fraïssé method and the planted clique conjecture
- An extension of the Ehrenfeucht-Fraïssé game for first order logics augmented with Lindström quantifiers
- Countable infinite existentially closed models of universally axiomatizable theories
- scientific article; zbMATH DE number 3148408 (Why is no real title available?)
- Isometric uniqueness of a complementably universal Banach space for Schauder decompositions
- Automatic models of first order theories
- Solutions and query rewriting in data exchange
- Graph connectivity, monadic NP and built-in relations of moderate degree
- The universal Banach space with a $K$-suppression unconditional basis
- Structure and Power: an Emerging Landscape
- Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures
- The Cayley-graph of the queue monoid: logic and decidability
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- scientific article; zbMATH DE number 7407779 (Why is no real title available?)
- A Practical Approach to Courcelle's Theorem
- Logic and Game Theory
- Metrically universal abelian groups
- GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC
- An undecidable linear order that is \(n\)-decidable for all \(n\)
- Strongly minimal Steiner systems. II: Coordinatization and quasigroups
- Comparing the power of monadic NP games
- Arboreal categories and equi-resource homomorphism preservation theorems
- First-order logic axiomatization of metric graph theory
- Count-free Weisfeiler-Leman and group isomorphism
- Generalized implicit definitions on finite structures
- The modal logics of the poison game
- An inverse Fraïssé limit for finite posets and duality for posets and lattices
- Strictly n-finite varieties of Heyting algebras
- On the descriptive complexity of groups without abelian normal subgroups
- On the parallel complexity of group isomorphism via Weisfeiler-Leman
- On the descriptive complexity of groups without abelian normal subgroups (extended abstract)
- Inherent complexity of recursive queries
- First order complexity of finite random structures
- Gadget construction and structural convergence
- On generic topological embeddings
- Multi-structural games and number of quantifiers
- Multi-structural games and beyond
- The Sherali-Adams and Weisfeiler-Leman hierarchies in (promise valued) constraint satisfaction problems
- On the number of quantifiers needed to define Boolean functions
- Existential and positive games: a comonadic and axiomatic view
- Invariance under stuttering in a temporal logic of actions
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
- Computational complexity of determining which statements about causality hold in different space-time models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3230355)