Re: Computability Logic
"Giorgi Japaridze" <[email protected]>
| Newsgroups | gmane.science.mathematics.frogs |
|---|---|
| Message-ID | <[email protected]> |
> Giorgi,
>
> I think the very first thing to do is to examine an axiomatisation of
> the smallest fragment of computability logic and see how our methods
> perform. I mean: just a page with the syntax and all the axioms.
> Could you point us to it, or, much better, could you post such a
> thing on Frogs? In this way we have a simple and common object to
> discuss.
>
> -Alessio
Probably the simplest fragment to look at would be CL1. If nothing
interesting comes out this time, there are a couple of other "the simplest"
fragments to try. CL1 is presented in Section 6 of
"Computability logic: a formal theory of interaction" at
http://www.csc.villanova.edu/~japaridz/CL/CLFTI.pdf
Here I am attaching a page that reproduces the relevant pieces of that
section. The paper was written for a different sort of readers and my
apologies if some explanations or examples seem redundant.
- Giorgi
Frogs1.pdf
(application/pdf, 34 KB) - not displayed