Switch to: References

Add citations

You must login to add citations.
  1. The taming of recurrences in computability logic through cirquent calculus, Part I.Giorgi Japaridze - 2013 - Archive for Mathematical Logic 52 (1-2):173-212.
    This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ${\neg}$ , parallel conjunction ${\wedge}$ , parallel disjunction ${\vee}$ , branching recurrence ⫰, and branching corecurrence ⫯. The article is published in two parts, with (the present) Part I containing preliminaries and a soundness proof, and (the forthcoming) Part II containing a completeness proof.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The Parallel versus Branching Recurrences in Computability Logic.Wenyan Xu & Sanyang Liu - 2013 - Notre Dame Journal of Formal Logic 54 (1):61-78.
    This paper shows that the basic logic induced by the parallel recurrence $\hspace {-2pt}\mbox {\raisebox {-0.01pt}{\@setfontsize \small {7}{8}$\wedge$}\hspace {-3.55pt}\raisebox {4.5pt}{\tiny $\mid$}\hspace {2pt}}$ of computability logic (i.e., the one in the signature $\{\neg,$\wedge$,\vee,\hspace {-2pt}\mbox {\raisebox {-0.01pt}{\@setfontsize \small {7}{8}$\wedge$}\hspace {-3.55pt}\raisebox {4.5pt}{\tiny $\mid$}\hspace {2pt}},\hspace {-2pt}\mbox {\raisebox {0.12cm}{\@setfontsize \small {7}{8}$\vee$}\hspace {-3.6pt}\raisebox {0.02cm}{\tiny $\mid$}\hspace {2pt}}\}$ ) is a proper superset of the basic logic induced by the branching recurrence $\mbox {\raisebox {-0.05cm}{$\circ$}\hspace {-0.11cm}\raisebox {3.1pt}{\tiny $\mid$}\hspace {2pt}}$ (i.e., the one in the signature $\{\neg,$\wedge$,\vee,\mbox {\raisebox {-0.05cm}{$\circ$}\hspace {-0.11cm}\raisebox (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The countable versus uncountable branching recurrences in computability logic.Wenyan Xu & Sanyang Liu - 2012 - Journal of Applied Logic 10 (4):431-446.
    Download  
     
    Export citation  
     
    Bookmark   1 citation