Skip to content
<title>Channels - The Pebble-Relation Comonad in Finite Model Theory :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
The Pebble-Relation Comonad in Finite Model Theory
Search for more channels:
Similar Items: The Pebble-Relation Comonad in Finite Model Theory
Channel Options
View Record
Explore related channels
Quick Look
Game Comonads & Generalised Quantifiers
Quick Look
When is a container a comonad?
Quick Look
Pebble Games and Algebraic Proof Systems
Quick Look
Pebble Games, Proof Complexity, and Time-Space Trade-offs
Quick Look
Lower Bounds for Existential Pebble Games and k-Consistency Tests
Quick Look
Pebble Games and Algebraic Proof Systems
Quick Look
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
Quick Look
Trade-offs between classical and quantum space using spooky pebbling
Quick Look
Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens
Quick Look
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Quick Look
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
Quick Look
Entropy of pebble automata and space complexity
Quick Look
A Finite-Model-Theoretic View on Propositional Proof Complexity
Quick Look
Model Theory and Proof Theory of Coalgebraic Predicate Logic
Quick Look
2-target pebbling number of graphs
Quick Look
A Finite Axiomatisation of Finite-State Automata Using String Diagrams
Quick Look
Coherent and finiteness spaces
Quick Look
On streams that are finitely red
Quick Look
Relating homotopy equivalences to conservativity in dependent type theories with computation axioms
Quick Look
Admissibility in Finitely Generated Quasivarieties
Quick Look
Finite state verifiers with constant randomness
Quick Look
The Complexity of Bisimulation and Simulation on Finite Systems
Quick Look
Neighbourhood Structures: Bisimilarity and Basic Model Theory
Quick Look
The Complexity of Infinite Computations In Models of Set Theory
Load more items
View Record
Prev
Explore related channels
Next
