Location of Repository


By Japaridze Giorgi (-vlnv-c


The intuitionistic fragment of computability logic at the propositional level. (English summary) Ann. Pure Appl. Logic 147 (2007), no. 3, 187–227. Summary: “This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games between a machine and its environment. Intuitionistic implication is understood as algorithmic reduction in the weakest possible—and hence most natural—sense, disjunction and conjunction as deterministic-choice combinations of problems (disjunction = machine’s choice, conjunction = environment’s choice), and ‘absurd ’ a

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.