On the constant domains principle and its weakened versions in the Kripke sheaf semantics

4 pages•Published: July 28, 2014

Abstract

Two weakened versions of the constant domains principle D are considered.
The Kripke sheaf incompleteness of superintuitionistic predicate logics,
obtained by adding these weakened principles to predicate versions
of superintuitionistic propositional logics of finite slices, is claimed.
So a difference between these principles and the principle D is shown.
The incompleteness proof uses the functor semantics.

Keyphrases: constant domains principle, functor semantics, kripke sheaf semantics, superintuitionistic predicate logics

In: Nikolaos Galatos, Alexander Kurz and Constantine Tsinakis (editors). TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic, vol 25, pages 204-207.

Links:	https://easychair.org/publications/paper/RKb
	https://doi.org/10.29007/b3z6

BibTeX entry

@inproceedings{TACL2013:constant_domains_principle_its,
  author    = {Dmitry Skvortsov},
  title     = {On the constant domains principle and its weakened versions in the Kripke sheaf semantics },
  booktitle = {TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic},
  editor    = {Nikolaos Galatos and Alexander Kurz and Constantine Tsinakis},
  series    = {EPiC Series in Computing},
  volume    = {25},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/RKb},
  doi       = {10.29007/b3z6},
  pages     = {204-207},
  year      = {2014}}

Download PDF Open PDF in browser