A logical basis for constructive systems (Q2893325)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A logical basis for constructive systems |
scientific article; zbMATH DE number 6048170
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A logical basis for constructive systems |
scientific article; zbMATH DE number 6048170 |
Statements
A logical basis for constructive systems (English)
0 references
20 June 2012
0 references
computability logic
0 references
interactive computation
0 references
implicit computational complexity
0 references
game semantics
0 references
constructive logics
0 references
efficiency logics
0 references
Computability logic was introduced by the author [Ann. Pure Appl. Logic 123, No. 1--3, 1--99 (2003; Zbl 1028.03025); in: Interactive computation. The new paradigm. Berlin: Springer. 183--223 (2006; \url{doi:10.1007/3-540-34874-3_9}); in: Logic, Epistemology, and the Unity of Science 15, 249--350 (2009; Zbl 1171.03015)] as an alternative to the classical semantics based on computability and game theory. The main idea is considering logical formulas as games played by a machine against its environment. In this article a way of measuring the complexity of a winning strategy for the machine is proposed. A sequent system CL12 is stated and its soundness and completeness with respect to the semantics based on polynomial-time computability is proved.
0 references
