7 problems

Intuitionistic computability logic conjecture. The set of valid formulas of the resulting fragment of computability logic is described by Heyting's intuitionistic calculus…

Intuitionistic characterization conjecture. The valid formulas of this language are exactly those provable in Heyting's intuitionistic calculus.

Computability logic (CoL) has general atoms standing for games and elementary atoms standing for propositions; its $neg,mlc,mld$-subfragment is the fragment using negation and the…

Axiomatization impossibility conjecture. It is impossible, in principle, to axiomatize the full ${\neg,wedge,vee,sqcap,sqcup}$-fragment of CoL within the framework of traditional p…

Let $\textbf{CL15}$ be the cirquent calculus system with recurrence operators \text{\raisebox{-0.05cm}{circ}\hspace{-0.13cm}\raisebox{0.16cm}{\tiny mid}\hspace{2pt}} and…

Let $\textbf{CL15}$ be the cirquent calculus system with recurrence operators \text{\raisebox{-0.05cm}{circ}\hspace{-0.13cm}\raisebox{0.16cm}{\tiny mid}\hspace{2pt}} and…

The logic in question is $\textbf{CL11}$, whose derivability relation is written $\textbf{CL11}\vdash F$, and whose formulas are interpreted as computational problems. An HPM is a…