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}
}
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
13 Citations
18 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Unifying Logic, Language and Philosophy

  • G. Japaridze
  • 2009
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…