58 citations · 597 across the 38 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.LO2009★ 16 cited
From formulas to cirquents in computability logic
Giorgi Japaridze
Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theor…
cs.LO2009★ 17 cited
Toggling operators in computability logic
Giorgi Japaridze
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html ) is a research program for redeveloping logic as a formal theory of computability, as opposed to the formal…
cs.LO2009★ 1 cited
Ptarithmetic
Giorgi Japaridze
The present article introduces ptarithmetic (short for "polynomial time arithmetic") -- a formal number theory similar to the well known Peano arithmetic, but based on the recently…