To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Syntactic forcing models … - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Syntactic forcing models for coherent logic

Journal article
Authors M. Bezem
U. Buchholtz
Thierry Coquand
Published in Indagationes Mathematicae-New Series
Volume 29
Issue 6
Pages 1441-1464
ISSN 0019-3577
Publication year 2018
Published at Department of Computer Science and Engineering (GU)
Pages 1441-1464
Language en
Keywords Mathematics
Subject categories Computer and Information Science


We present three syntactic forcing models for coherent logic. These are based on sites whose underlying category only depends on the signature of the coherent theory, and they do not presuppose that the logic has equality. As an application we give a coherent theory T and a sentence psi which is T-redundant (for any geometric implication phi, possibly with equality, if T + psi proves phi, then T proves phi), yet false in the generic model of T. This answers in the negative a question by Wraith. (C) 2018 Royal Dutch Mathematical Society (KWG). Published by Elsevier B.V. All rights reserved.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?