Whither semantics?
From MaRDI portal
Publication:2286732
DOI10.1016/j.tcs.2019.06.029zbMath1506.03078arXiv2010.13328OpenAlexW4210391016WikidataQ127469426 ScholiaQ127469426MaRDI QIDQ2286732
Publication date: 22 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.13328
Related Items
Structure and Power: an Emerging Landscape ⋮ Arboreal categories and equi-resource homomorphism preservation theorems
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
- Unnamed Item
- Elements of finite model theory.
- Notions of computation and monads
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Infinitary logics and 0-1 laws
- Relating structure and power: comonadic semantics for computational resources (extended abstract)
- A structural approach to operational semantics
- Tree-depth, subgraph coloring and homomorphism bounds
- Every two elementarily equivalent models have isomorphic ultrapowers
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Profinite Monads, Profinite Equations, and Reiterman’s Theorem
- Categorical quantum mechanics
- Comonadic Notions of Computation
- A Categorical Semantics of Signal Flow Graphs
- Network Models
- Recognisable Languages over Monads
- Homomorphism preservation theorems
- Graph minors. II. Algorithmic aspects of tree-width
- The Sch\"utzenberger product for syntactic spaces
- Mackey-complete spaces and power series – a topological model of differential linear logic
- The sheaf-theoretic structure of non-locality and contextuality
- Quantifiers on languages and codensity monads
- Compositional Game Theory
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Contextuality, Cohomology and Paradox
- Semantic Unification
