Highly Influenced

# Propositional computability logic I

@article{Japaridze2006PropositionalCL, title={Propositional computability logic I}, author={Giorgi Japaridze}, journal={ACM Trans. Comput. Log.}, year={2006}, volume={7}, pages={302-330} }

- Published 2006 in ACM Trans. Comput. Log.
DOI:10.1145/1131313.1131318

In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a machine against the environment, their computability as existence of a machine that always wins the game, logical operators as operations on computational problems, and validity of a logical formula as being a scheme of “always computabl ” problems. Computability… CONTINUE READING

#### From This Paper

##### Topics from this paper.

23 Citations

4 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-4 of 4 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential