CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE

DOI10.1017/S1755020321000356MaRDI QIDQ6041349zbMATH OpenOpenAlexFDO

Authors Johannes Marti

Publication date 26 May 2023

Published in The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.00604

zbMATH Keywords

axiomatizationconvex geometryconditional logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Abstract: We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting the antecedent satisfy the consequent. Equivalently, a conditional is true if the antecedent is contained in the convex hull of the points that satisfy both the antecedent and consequent. Our result is then that every consistent formula without nested conditionals is satisfiable in a model based on a finite set of points in the plane. The proof relies on a result by Richter and Rogers showing that every finite abstract convex geometry can be represented by convex polygons in the plane.

Recommendations

• An axiom system for a spatial logic with convexity
• Some Completeness Results for Propositional Conditional Logics
• Completeness and correspondence in Chellas-Segerberg semantics
• Logic of convex order
• Tableau calculus for preference-based conditional logics, PCL and its extensions

Cites work

• scientific article; zbMATH DE number 6787689 (Why is no real title available?)
• A discrete duality between nonmonotonic consequence relations and convex geometries
• A modal walk through space
• A sequent calculus for preferential conditional logic based on neighbourhood semantics
• An Analysis of some Deontic Logics
• Basic conditional logic
• Choice Functions and Revealed Preference
• Choice functions and abstract convex geometries
• Coalgebraic semantics of modal logics: an overview
• Completeness of S4 with respect to the real line: revisited
• Conditional doxastic models: a qualitative approach to dynamic belief revision
• Convex geometries
• Dynamic logic for belief revision
• Dynamic logics of evidence-based beliefs
• Embedding convex geometries and a bound on convex dimension
• Finite convex geometries of circles
• From onions to broccoli: generalizing Lewis' counterfactual logic
• Greedoids
• Locally complete path independent choice functions and their lattices
• Meet-distributive lattices and the anti-exchange closure
• Nonmonotonic reasoning, preferential models and cumulative logics
• Ordering semantics and premise semantics for counterfactuals
• Partition and revision: the semantics of counterfactuals
• Points, lines and diamonds: a two-sorted modal logic for projective planes
• Quick completeness proofs for some logics of conditionals
• Representation of convex geometries by circles on the plane
• Representing convex geometries by almost-circles
• Shifting Priorities: Simple Representations for Twenty-Seven Iterated Theory Change Operators
• Similarity between preferential models
• The Modal Multilogic of Geometry
• The affine representation theorem for abstract convex geometries
• The algebra of topology
• The logic of conditionals. An application of probability to deductive logic
• The theory of convex geometries
• Two modellings for theory change
• Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics

This page was built for publication: CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041349)