8.6k citations
- Goddard Space Flight CenterUS158 papers
- California Institute of TechnologyUS156 papers
- Massachusetts Institute of TechnologyUS155 papers
- Centre National de la Recherche ScientifiqueFR144 papers
- University of WashingtonUS141 papers
- Center for Astrophysics Harvard & SmithsonianUS129 papers
- University of ChicagoUS127 papers
- Sorbonne UniversitéFR125 papers
- University of AmsterdamNL123 papers
- Radboud University NijmegenNL115 papers
- Korea Astronomy and Space Science InstituteKR114 papers
- University of CambridgeGB114 papers
25 papers · 1 filter
Build your own clarithmetic II: Soundness
Giorgi Japaridze
Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational pro…
Build your own clarithmetic I: Setup and completeness
Giorgi Japaridze
Clarithmetics are number theories based on computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). Formulas of these theories represent interactive computational pro…
On the system CL12 of computability logic
Giorgi Japaridze
Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as…
A PSPACE-Complete First Order Fragment of Computability Logic
Matthew S. Bauer
In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized…
The taming of recurrences in computability logic through cirquent calculus, Part II
Giorgi Japaridze
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorg…
The taming of recurrences in computability logic through cirquent calculus, Part I
Giorgi Japaridze
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorg…