Whither semantics?
From MaRDI portal
Publication:2286732
Abstract: We discuss how mathematical semantics has evolved, and suggest some new directions for future work. As an example, we discuss some recent work on encapsulating model comparison games as comonads, in the context of finite model theory.
Recommendations
Cites work
- A categorical semantics of signal flow graphs
- A structural approach to operational semantics
- Categorical quantum mechanics
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Comonadic notions of computation
- Compositional game theory
- Contextuality, Cohomology and Paradox
- Elements of finite model theory.
- Every two elementarily equivalent models have isomorphic ultrapowers
- Graph minors. II. Algorithmic aspects of tree-width
- Homomorphism preservation theorems
- scientific article; zbMATH DE number 431759 (Why is no real title available?)
- scientific article; zbMATH DE number 3856436 (Why is no real title available?)
- scientific article; zbMATH DE number 4035108 (Why is no real title available?)
- scientific article; zbMATH DE number 3658971 (Why is no real title available?)
- scientific article; zbMATH DE number 3694561 (Why is no real title available?)
- scientific article; zbMATH DE number 3709584 (Why is no real title available?)
- scientific article; zbMATH DE number 3742588 (Why is no real title available?)
- scientific article; zbMATH DE number 1341606 (Why is no real title available?)
- scientific article; zbMATH DE number 1098983 (Why is no real title available?)
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 3344531 (Why is no real title available?)
- scientific article; zbMATH DE number 3383521 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- Infinitary logics and 0-1 laws
- Mackey-complete spaces and power series -- a topological model of differential linear logic
- Network models
- Notions of computation and monads
- Profinite monads, profinite equations, and Reiterman's theorem
- Quantifiers on languages and codensity monads
- Recognisable languages over monads
- Relating structure and power: comonadic semantics for computational resources (extended abstract)
- Semantic unification. A sheaf theoretic approach to natural language
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The pebbling comonad in finite model theory
- The Schützenberger product for syntactic spaces
- The sheaf-theoretic structure of non-locality and contextuality
- Tree-depth, subgraph coloring and homomorphism bounds
Cited in
(7)- What holds in a context?
- Changing a Semantics: Opportunism or Courage?
- Structure and Power: an Emerging Landscape
- Arboreal categories and equi-resource homomorphism preservation theorems
- Duality, intensionality, and contextuality: philosophy of category theory and the categorical unity of science in Samson Abramsky
- Structure in machine learning
- Existential and positive games: a comonadic and axiomatic view
This page was built for publication: Whither semantics?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286732)