Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
The intellectual property (IP) business model is vulnerable to a number of potentially devastating obstructions, such as misappropriation and intellectual property fraud. We propo...