# Provability multilattice logic

Provability multilattice logic In this paper, we introduce provability multilattice logic and multilattice arithmetic which extends first-order multilattice logic with equality by multilattice versions of Peano axioms. We show that has the provability interpretation with respect to and prove the arithmetic completeness theorem for it. We formulate in the form of a nested sequent calculus and show that cut is admissible in it. We introduce the notion of a provability multilattice and develop algebraic semantics for on its basis, by the method of Lindenbaum-Tarski algebras we prove the algebraic completeness theorem. We present Kripke semantics for and establish the Kripke completeness theorem via syntactical and semantic embeddings from into and vice versa. Last but not least, the decidability of is shown. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Applied Non-Classical Logics Taylor & Francis

# Provability multilattice logic

, Volume 32 (4): 34 – Oct 2, 2022
34 pages

/lp/taylor-francis/provability-multilattice-logic-2GgEVU10jF

# References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Taylor & Francis
© 2023 Informa UK Limited, trading as Taylor & Francis Group
ISSN
1958-5780
eISSN
1166-3081
DOI
10.1080/11663081.2023.2178780
Publisher site
See Article on Publisher Site

### Abstract

In this paper, we introduce provability multilattice logic and multilattice arithmetic which extends first-order multilattice logic with equality by multilattice versions of Peano axioms. We show that has the provability interpretation with respect to and prove the arithmetic completeness theorem for it. We formulate in the form of a nested sequent calculus and show that cut is admissible in it. We introduce the notion of a provability multilattice and develop algebraic semantics for on its basis, by the method of Lindenbaum-Tarski algebras we prove the algebraic completeness theorem. We present Kripke semantics for and establish the Kripke completeness theorem via syntactical and semantic embeddings from into and vice versa. Last but not least, the decidability of is shown.

### Journal

Journal of Applied Non-Classical LogicsTaylor & Francis

Published: Oct 2, 2022

Keywords: Multilattice logic; provability logic; nested sequent calculus; Peano arithmetic; embedding theorem

### References

Access the full text.

Sign up today, get DeepDyve free for 14 days.