Fresh logic: Proof-theory and semantics for FM and nominal techniques
From MaRDI portal
Publication:2372191
DOI10.1016/J.JAL.2005.10.012zbMATH Open1124.03010OpenAlexW2092116738MaRDI QIDQ2372191FDOQ2372191
Authors: Murdoch J. Gabbay
Publication date: 25 July 2007
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2005.10.012
Recommendations
Cites Work
- Nominal logic, a first order theory of names and binding
- Endliche Gruppen I
- A new approach to abstract syntax with variable binding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A spatial logic for concurrency. I
- Title not available (Why is that?)
- Harvey Friedman's research on the foundations of mathematics
- \(\pi\)-calculus in (Co)inductive-type theory
- Title not available (Why is that?)
- Consistency of the theory of contexts
- A proof theory for generic judgments
- The foundation of a generic theorem prover
- Kripke-style models for typed lambda calculus
- Title not available (Why is that?)
- About \({|}/{|}\)-quantifiers
- Computer Science Logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- The continuum and first-order intuitionistic logic
- Title not available (Why is that?)
Cited In (19)
- About \({|}/{|}\)-quantifiers
- Title not available (Why is that?)
- A semantics for nabla
- PNL to HOL: from the logic of nominal sets to the logic of higher-order functions
- Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
- Nominal abstraction
- Foundations of nominal techniques: logic and semantics of variables in abstract syntax
- Nominal logic, a first order theory of names and binding
- Title not available (Why is that?)
- Completeness and Herbrand theorems for nominal logic
- On a monadic semantics for freshness
- A simple sequent calculus for nominal logic
- A simple nominal type theory
- αCheck: A mechanized metatheory model checker
- Nominal equational logic
- Title not available (Why is that?)
- Foundations of Software Science and Computational Structures
- Equivariant ZFA and the foundations of nominal techniques
- Modelling generic judgements
Uses Software
This page was built for publication: Fresh logic: Proof-theory and semantics for FM and nominal techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372191)