English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The work is devoted to  Computability logic  (CoL)—the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing  truth  by  computability  in its underlying semantics. This article elaborates some basic complexity theory for the CoL framework. Then it proves soundness and completeness for the deductive system CL12 with respect to the semantics of CoL, including the version of the latter based on polynomial time computability instead of computability-in-principle. CL12 is a sequent calculus system, where the meaning of a sequent intuitively can be characterized as ‘the succedent is algorithmically reducible to the antecedent’, and where formulas are built from predicate letters, function letters, variables, constants, identity, negation, parallel and choice connectives and blind and choice quantifiers. A case is made that CL12 is an adequate logical basis for constructive applied theories, including complexity-oriented ones.  MSC : primary: 03F50; secondary: 03D75; 03D15; 03D20; 68Q10; 68T27; 68T30.

A logical basis for constructive systems