Abstract
We investigate models of first-order logic designed to give semantics to reductive proof-search systems, with special attention to the so-called gamma- and delta-rules controlling quantifiers. The key innovation is the use of syntax and semantics with (finitely supported) name-symmetry, in the style of nominal techniques.
| Original language | English |
|---|---|
| Pages (from-to) | 473-523 |
| Number of pages | 51 |
| Journal | Journal of Logic and Computation |
| Volume | 25 |
| Issue number | 2 |
| Early online date | 23 Feb 2013 |
| DOIs | |
| Publication status | Published - Apr 2015 |
Keywords
- proof-search
- nominal techniques
- name-symmetry
- higher-order logic
- quantifiers
- CAPTURE-AVOIDING SUBSTITUTION
- VARIABLE SEMANTIC TABLEAUX
- DELTA-RULE
- UNIFICATION
- ALGEBRA
- INFINITE
- BINDING
- NAMES