Reproduce “Fundamentals of computability logic 2020” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Giorgi Japaridze
This paper presents Computability Logic (CoL), a foundational framework that redefines logical truth as computability in an interactive, game-theoretic setting. It introduces an extensive system of logical operators and proof theories that allow for the systematic modeling, specification, and deductive analysis of complex computational tasks and their resource dependencies, with provable links to computational complexity classes and algorithmic extractability from proofs.
Key insights
- Logic should be conceived as a universal intellectual tool for navigating real-life interactions, with games serving as the most adequate mathematical models for these interactions.
- Computational problems are inherently interactive and are best modeled as 'games' between a machine and its environment.
- Logical operators can be systematically generalized to capture diverse forms of interaction, resource management, and various computational relations.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.