Highly Influenced

# Toggling operators in computability logic

@article{Japaridze2011TogglingOI, title={Toggling operators in computability logic}, author={Giorgi Japaridze}, journal={Theor. Comput. Sci.}, year={2011}, volume={412}, pages={971-1004} }

- Published 2011 in Theor. Comput. Sci.
DOI:10.1016/j.tcs.2010.11.037

Computability logic (CL) is a recently introduced semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more traditionally been. Formulas in CL stand for interactive computational problems, seen as games between a machine and its environment; logical operators represent operations on such entities; and “truth” is understood as existence of an effective solution, i.e., of an algorithmic winning… CONTINUE READING

Highly Cited

This paper has 20 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

13 Citations

18 References

Similar Papers