English

Cut-free Deductive System for Continuous Intuitionistic Logic

Logic in Computer Science 2026-02-06 v4 Logic

Abstract

We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras USC(L)USC(\mathcal{L}) of sup-preserving functions from [0,1][0,1] to an integral commutative residuated complete lattice L\mathcal{L} (in the intuitionistic case, L\mathcal{L} is a locale). We give an algebraic axiomatisation of AC-algebras in the language of continuous logic and prove, using the Macneille completion, that every Archimedean model embeds into some AC-algebra. We also show that (i) USC(L)USC(\mathcal{L}) satisfies v+˙v=2vv \dot + v = 2v exactly when L\mathcal{L} is a locale, (ii) involutiveness of negation in USC(L)USC(\mathcal{L}) corresponds to that in L\mathcal{L} , and that (iii) adding those conditions recovers classical continuous logic. For each variant -affine, intuitionistic, involutive, classical -we provide a sequent style deductive system and prove completeness and cut admissibility. This yields the first sequent style formulation of classical continuous logic enjoying cut admissibility.

Keywords

Cite

@article{arxiv.2510.26849,
  title  = {Cut-free Deductive System for Continuous Intuitionistic Logic},
  author = {Guillaume Geoffroy},
  journal= {arXiv preprint arXiv:2510.26849},
  year   = {2026}
}
R2 v1 2026-07-01T07:14:29.313Z