Ackermann's implication for typefree logic
Ackermann's implicationalgebraic semanticsimplicative logicpartial logicpositive Ackermann latticepositive fragmentsubstructural logictype-free logics
Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03) Other algebras related to logic (03G25)
The implication in Ackermann's system of partial logic has a deductive interpretation, viz. \( A \to B\) means that \(B\) is derivable from \(A\). The paper studies the positive fragment of Ackermann's logic and gives a Hilbert-style and a natural deduction formulations for it. Then it is characterized by a hierarchy of deductive systems. Finally, the paper introduces a new algebraic semantics for the positive fragment of Ackermann's system in terms of so-called `positive Ackermann's lattices', and establishes a completeness result with respect to this semantics.
This page was built for publication: Ackermann's implication for typefree logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2720395)