A model of intuitionistic affine logic from stable domain theory

DOI10.1007/3-540-58201-0_80zbMath1422.03134OpenAlexW2165368206MaRDI QIDQ4632438

Torben Braüner

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_80

zbMATH Keywords

natural transformationforgetful functorleft adjointstable functionfinite product

Mathematics Subject Classification ID

Adjoint functors (universal constructions, reflective subcategories, Kan extensions, etc.) (18A40) Semantics in the theory of computing (68Q55) Categorical logic, topoi (03G30) Continuous lattices and posets, applications (06B35) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cites Work

• A note on inconsistencies caused by fixpoints in a cartesian closed category
• Semantics of weakening and contraction
• Some monoidal closed categories of stable domains and event structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item