Year: 2025
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Authors: Leuştean, Laurenţiu, Trufaş, Dafina
Language: English
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4414987646
Cites:
Cited by:
Related to: