Game-theoretic semantics and partial specifications
Antti Kuusisto
TL;DR
This paper compares the compositional and game-theoretic approaches to partial specifications in first-order logic and its Turing-complete extension, highlighting their differences and similarities.
Contribution
It provides a comparative analysis of the two approaches to partial specifications in both first-order logic and a Turing-complete extension.
Findings
Highlights differences between compositional and game-theoretic methods
Analyzes partial specifications in first-order logic and extensions
Provides insights into the applicability of each approach
Abstract
We discuss partial specifications in first-order logic FO and also in a Turing-complete extension of FO. We compare the compositional and game-theoretic approaches to the systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Computability, Logic, AI Algorithms