Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
From MaRDI portal
Publication:2915895
DOI10.2178/jsl/1344862164zbMath1251.03035arXiv1112.0923OpenAlexW2117028226MaRDI QIDQ2915895
Publication date: 19 September 2012
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.0923
completenessnominal algebrafinite supportinfinite supportpermissive-nominal logicinfinite atoms-abstractionpermissive-nominal techniques
Logic in computer science (03B70) Other algebras related to logic (03G25) Applications of model theory (03C98)
Related Items (3)
Unity in nominal equational reasoning: the algebra of equality on nominal sets ⋮ PNL to HOL: from the logic of nominal sets to the logic of higher-order functions ⋮ Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
Cites Work
- Unnamed Item
- A new approach to abstract syntax with variable binding
- Nominal unification
- Nominal logic, a first order theory of names and binding
- A general mathematics of names
- On theories with a combinatorial definition of 'equivalence'
- Permissive-nominal logic
- Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax
- Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
- Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
- A Formal Calculus for Informal Equality with Binding
- Nominal Algebra and the HSP Theorem
- Nominal (Universal) Algebra: Equational Logic with Names and Binding
- Meta-variables as infinite lists in nominal terms unification and rewriting
- Completeness and Herbrand theorems for nominal logic
This page was built for publication: Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
