As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
This paper presents a part of work in progress on axiomatizing a spatial logic with convexity and inclusion predicates (hereinafter called convexity logic), with some intended interpretation over the real plane. More formally, let Lconv,≤ be a language of first order logic and two non-logical primitives: conv (interpreted as a property of a set of being convex) and ≤ (interpreted as the set inclusion relation). We let variables range over regular open rational polygons in the real plane (denoted ROQ(R2)). We call the tuple M = 〈ROQ, conv, ≤〉 — where primitives are defined as indicated above — a standard model. We propose an axiomatization of the theory of M and prove soundness and completeness for this axiomatization.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.