Some Turing-complete extensions of first-order logic
From MaRDI portal
Abstract: We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the possibility of recursive looping when a formula is evaluated using a semantic game. We first define a game-theoretic semantics for the logic and then prove that the expressive power of the logic corresponds in a canonical way to the recognition capacity of Turing machines. Finally, we show how to incorporate generalized quantifiers into the logic and argue for a highly natural connection between oracles and generalized quantifiers.
Recommendations
Cited in
(9)- A PSPACE-complete first-order fragment of computability logic
- Bounded game-theoretic semantics for modal mu-calculus
- scientific article; zbMATH DE number 7655660 (Why is no real title available?)
- scientific article; zbMATH DE number 824731 (Why is no real title available?)
- The logic of Turing progressions
- scientific article; zbMATH DE number 5238362 (Why is no real title available?)
- Uniform proofs of standard completeness for extensions of first-order MTL
- scientific article; zbMATH DE number 7455742 (Why is no real title available?)
- An expansion of first-order Belnap-Dunn logic
This page was built for publication: Some Turing-complete extensions of first-order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995355)