First-order logic with self-reference
From MaRDI portal
Publication:6405074
arXiv2207.07397MaRDI QIDQ6405074FDOQ6405074
Authors: Antti Kuusisto 
Publication date: 15 July 2022
Abstract: We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two closely related but different logics. We provide a natural deduction system that is complete for validities for both of these logics, and we also investigate a range of related basic decision problems. For example, the validity problems of the two-variable fragments of the logics are shown coNexpTime-complete, which is in stark contrast with the high undecidability of two-variable logic extended with least fixed points. We also argue for the naturalness and benefits of the investigated approach to recursion and self-reference by, for example, relating the new logics to Lindstrom's Second Theorem.
Logic with extra quantifiers and operators (03C80) Proof theory in general (including proof-theoretic semantics) (03F03) Classical first-order logic (03B10)
This page was built for publication: First-order logic with self-reference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405074)
