A general mathematics of names

DOI10.1016/J.IC.2006.10.010MaRDI QIDQ2373874zbMATH OpenOpenAlexFDO

Authors Murdoch J. Gabbay

Publication date 16 July 2007

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2006.10.010

zbMATH Keywords

nominal techniquesalpha-conversionFraenkel-Mostowski set theoryde Bruijn indicesBarendregt representativesbinding of infinitely many namesFM setsname-carrying syntaxnew quantifierscope extrusion

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Nonclassical and second-order set theories (03E70) Inductive definability (03D70)

Recommendations

• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• A new approach to abstract syntax with variable binding
• Computer Science Logic
• On the development of the Fraenkel-Mostowski set theory
• Nominal sets. Names and symmetry in computer science

Cites work

• scientific article; zbMATH DE number 4045703 (Why is no real title available?)
• scientific article; zbMATH DE number 3559512 (Why is no real title available?)
• scientific article; zbMATH DE number 1231616 (Why is no real title available?)
• scientific article; zbMATH DE number 663786 (Why is no real title available?)
• scientific article; zbMATH DE number 2154399 (Why is no real title available?)
• scientific article; zbMATH DE number 874294 (Why is no real title available?)
• scientific article; zbMATH DE number 3400430 (Why is no real title available?)
• A calculus of mobile processes. II
• A fixedpoint approach to implementing (co)inductive definitions
• A new approach to abstract syntax with variable binding
• FreshML: programming with binders made simple
• Handbook of philosophical logic. Vol. 5
• Nominal logic, a first order theory of names and binding
• On a monadic semantics for freshness
• Set theory. An introduction to independence proofs
• Some lambda calculus and type theory formalized
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(15)

• Alpha equivalence equalities
• On the development of the Fraenkel-Mostowski set theory
• Mathematical models of systems of transcription of name-and-surname groups
• On the rule of \(k\) names
• PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
• A formalized general theory of syntax with bindings
• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
• A formalized general theory of syntax with bindings: extended version
• Representation and duality of the untyped \(\lambda\)-calculus in nominal lattice and topological semantics, with a proof of topological completeness
• Foundations of nominal techniques: logic and semantics of variables in abstract syntax
• Game semantics in the nominal model
• A basic method for naming Persian karbandis using a set of numbers
• Finite and infinite support in nominal algebra and logic: nominal completeness theorems for free
• Two-level nominal sets and semantic nominal terms: an extension of nominal set theory for handling meta-variables
• Two-level lambda-calculus

Describes a project that uses

Uses Software

• FreshML
• Isabelle/ZF

This page was built for publication: A general mathematics of names

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373874)