Nominal semantics for predicate logic: algebras, substitution, quantifiers, and limits
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914480497098752 |
|---|---|
| author | Dowek, Gilles Gabbay, Murdoch J. |
| author_facet | Dowek, Gilles Gabbay, Murdoch J. |
| contents | We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which is the denotation of the term a (which is also a variable symbol). Similarly, the algebra interpreting predicates in the model directly interprets open predicates. Because of this models must also incorporate notions of substitution and quantification. These notions are axiomatic, and need not be applied only to sets of syntax. We prove soundness and show how every 'ordinary' model (i.e. model based on sets and valuations) can be translated to one of our nominal models, and thus also prove completeness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_16487 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Nominal semantics for predicate logic: algebras, substitution, quantifiers, and limits Dowek, Gilles Gabbay, Murdoch J. Logic in Computer Science We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which is the denotation of the term a (which is also a variable symbol). Similarly, the algebra interpreting predicates in the model directly interprets open predicates. Because of this models must also incorporate notions of substitution and quantification. These notions are axiomatic, and need not be applied only to sets of syntax. We prove soundness and show how every 'ordinary' model (i.e. model based on sets and valuations) can be translated to one of our nominal models, and thus also prove completeness. |
| title | Nominal semantics for predicate logic: algebras, substitution, quantifiers, and limits |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2312.16487 |