Matching logic -- a new axiomatization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912448734298112 |
|---|---|
| author | Leuştean, Laurenţiu Trufaş, Dafina |
| author_facet | Leuştean, Laurenţiu Trufaş, Dafina |
| contents | In these notes we propose a new, simpler proof system for first-order matching logic with application and definedness. The new proof system is inspired by Tarski's axiomatization for first order-logic with equality (simplified by Kalish and Montague), that does not involve the notions of a free variable and free substitution. We give also a proof system for first-order matching logic with application, obtained by adapting to matching logic Gödel's proof system for first-order intuitionistic logic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13801 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Matching logic -- a new axiomatization Leuştean, Laurenţiu Trufaş, Dafina Logic in Computer Science Logic 03B70, 68Q55 F.3.1 In these notes we propose a new, simpler proof system for first-order matching logic with application and definedness. The new proof system is inspired by Tarski's axiomatization for first order-logic with equality (simplified by Kalish and Montague), that does not involve the notions of a free variable and free substitution. We give also a proof system for first-order matching logic with application, obtained by adapting to matching logic Gödel's proof system for first-order intuitionistic logic. |
| title | Matching logic -- a new axiomatization |
| topic | Logic in Computer Science Logic 03B70, 68Q55 F.3.1 |
| url | https://arxiv.org/abs/2506.13801 |