Logics of Finite Hankel Rank
From MaRDI portal
Publication:2947177
DOI10.1007/978-3-319-23534-9_14zbMath1465.03076arXiv1512.02507OpenAlexW2194181321MaRDI QIDQ2947177
Nadia Labai, Johann A. Makowsky
Publication date: 22 September 2015
Published in: Fields of Logic and Computation II (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.02507
Related Items (2)
Logics of Finite Hankel Rank ⋮ A logic-based approach to incremental reasoning on multi-agent systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithmic uses of the Feferman-Vaught theorem
- Characterizing specification languages which admit initial semantics
- Why Horn formulas matter in computer science: initial structures and generic examples
- Model theory.
- The monadic theory of order
- On the expressive power of data dependencies
- Realizations by stochastic finite automata
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Connection Matrices and the Definability of Graph Parameters
- Logics of Finite Hankel Rank
- The first order properties of products of algebraic systems
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Some useful preservation theorems
- Languages that Capture Complexity Classes
- Modest theory of short chains. I
- Two notes on abstract model theory. I. Properties invariant on the range of definable relations between structures
- Axioms for abstract model theory
- Finiteness conditions for graph algebras over tropical semirings
- Fifty years of the spectrum problem: survey and new results
- Evaluations of Graph Polynomials
- On Extensions of Elementary Logic
- Persistent and invariant formulas relative to theories of higher order
- Logics capturing relativized complexity classes uniformly
This page was built for publication: Logics of Finite Hankel Rank
