Hostname: page-component-848d4c4894-pjpqr Total loading time: 0 Render date: 2024-06-17T17:43:59.441Z Has data issue: false hasContentIssue false


Published online by Cambridge University Press:  08 July 2021



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.

Research Article
© The Author(s), 2021. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)


Adams, E. (1975). The Logic of Conditionals: An Application of Probability to Deductive Logic. Dordrecht: Springer.CrossRefGoogle Scholar
Adaricheva, K., & Bolat, M. (2019). Representation of convex geometries by circles on the plane. Discrete Mathematics, 342(3), 726746.CrossRefGoogle Scholar
Adaricheva, K., & Nation, J. B. (2016). Convex geometries. In Grätzer, G., and Wehrung, F., editors. Lattice Theory: Special Topics and Applications. Basel: Birkhäuser, pp. 153179.CrossRefGoogle Scholar
Aiello, M., & van Benthem, J. (2002). A modal walk through space. Journal of Applied Non-Classical Logics, 12(3–4), 319363.CrossRefGoogle Scholar
Arrow, K. J. (1959). Rational choice functions and orderings. Economica, 26(102), 121127.CrossRefGoogle Scholar
Balbiani, P. (1998). The modal multilogic of geometry. Journal of Applied Non-Classical Logics, 8(3), 259281.CrossRefGoogle Scholar
Baltag, A., & Smets, S. (2006). Conditional doxastic models: A qualitative approach to dynamic belief revision. Electronic Notes in Theoretical Computer Science, 165, 521.CrossRefGoogle Scholar
Bezhanishvili, G., & Gehrke, M. (2005). Completeness of S4 with respect to the real line: Revisited. Annals of Pure and Applied Logic, 131(1–3), 287301.CrossRefGoogle Scholar
Burgess, J. (1981). Quick completeness proofs for some logics of conditionals. Notre Dame Journal of Formal Logic, 22(1), 7684.CrossRefGoogle Scholar
Chellas, B. F. (1975). Basic conditional logic. Journal of Philosophical Logic, 4(2), 133153.CrossRefGoogle Scholar
Czédli, G. (2014). Finite convex geometries of circles. Discrete Mathematics, 330, 6175.CrossRefGoogle Scholar
Czédli, G., & Kincses, J. (2017). Representing convex geometries by almost-circles. Acta Scientiarum Mathematicarum, 83, 393414.CrossRefGoogle Scholar
Edelman, P. H. (1980). Meet-distributive lattices and the anti-exchange closure. Algebra Universalis, 10(1), 290299.CrossRefGoogle Scholar
Edelman, P. H., & Jamison, R. E. (1985). The theory of convex geometries. Geometriae Dedicata, 19(3), 247270.CrossRefGoogle Scholar
Geffner, H. (1992). High-probabilities, model-preference and default arguments. Minds and Machines, 2(1), 5170.CrossRefGoogle Scholar
Girard, P. (2007). From onions to broccoli: Generalizing Lewis' counterfactual logic. Journal of Applied Non-Classical Logics, 17(2), 213229.CrossRefGoogle Scholar
Girlando, M., Negri, S., & Olivetti, N. (2021). Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics. Journal of Logic and Computation. Scholar
Grove, A. (1988). Two modellings for theory change. Journal of Philosophical Logic, 17(2), 157170.CrossRefGoogle Scholar
Hansson, B. (1969). An analysis of some deontic logics. Noûs, 3(4), 373398.CrossRefGoogle Scholar
Johnson, M. R., & Dean, R. A. (2001). Locally complete path independent choice functions and their lattices. Mathematical Social Sciences, 42(1), 5387.CrossRefGoogle Scholar
Kashiwabara, K., Nakamura, M., & Okamoto, Y. (2005). The affine representation theorem for abstract convex geometries. Computational Geometry, 30(2), 129144.CrossRefGoogle Scholar
Korte, B., Lovász, L., & Schrader, R. (1991). Greedoids. Berlin: Springer.CrossRefGoogle Scholar
Koshevoy, G. A. (1999). Choice functions and abstract convex geometries. Mathematical Social Sciences, 38(1), 3544.CrossRefGoogle Scholar
Kratzer, A. (1981). Partition and revision: The semantics of counterfactuals. Journal of Philosophical Logic, 10(2), 201216.CrossRefGoogle Scholar
Kraus, S., Lehmann, D., & Magidor, M. (1990). Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44(1–2), 167207.CrossRefGoogle Scholar
Kupke, C., & Pattinson, D. (2011). Coalgebraic semantics of modal logics: An overview. Theoretical Computer Science, 412(38), 50705094.CrossRefGoogle Scholar
Lewis, D. (1973). Counterfactuals. Malden, MA: Blackwell.Google Scholar
Lewis, D. (1981). Ordering semantics and premise semantics for counterfactuals. Journal of Philosophical Logic, 10(2), 217234.CrossRefGoogle Scholar
Marti, J., & Pinosio, R. (2014). Topological semantics for conditionals. In Punčochář, V., and Švarný, P., editors. The Logica Yearbook 2013. London: College Publications, pp. 115128.Google Scholar
Marti, J., & Pinosio, R. (2020). A discrete duality between nonmonotonic consequence relations and convex geometries. Order, 37, 151171.CrossRefGoogle Scholar
McKinsey, J. C. C., & Tarski, A. (1944). The algebra of topology. Annals of Mathematics, 45(1), 141191.CrossRefGoogle Scholar
Negri, S., & Olivetti, N. (2015). A sequent calculus for preferential conditional logic based on neighbourhood semantics. In De Nivelle, H., editor. Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2015. Cham: Springer, pp. 115134.CrossRefGoogle Scholar
Richter, M., & Rogers, L. G. (2017). Embedding convex geometries and a bound on convex dimension. Discrete Mathematics, 340(5), 10591063.CrossRefGoogle Scholar
Rott, H. (2009). Shifting priorities: Simple representations for twenty-seven iterated theory change operators. In Makinson, D., Malinowski, J., and Wansing, H., editors. Towards Mathematical Philosophy. Berlin: Springer, pp. 269296.CrossRefGoogle Scholar
Sen, A. (1971). Choice functions and revealed preference. The Review of Economic Studies, 38(3), 307317.CrossRefGoogle Scholar
Shoham, Y. (1988). Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence. Cambridge, MA: MIT Press.Google Scholar
van Benthem, J. (2007). Dynamic logic for belief revision. Journal of Applied Non-Classical Logics, 17(2), 129155.CrossRefGoogle Scholar
van Benthem, J., & Bezhanishvili, G. (2007). Modal logics of space. In Aiello, M., and Van Benthem Ian Pratt-Hartmann, J., editors. Handbook of Spatial Logics. Dordrecht: Springer, pp. 217298.CrossRefGoogle Scholar
van Benthem, J., & Pacuit, E. (2011). Dynamic logics of evidence-based beliefs. Studia Logica, 99(1–3), 6192.CrossRefGoogle Scholar
Veltman, F. (1976). Prejudices, presuppositions, and the theory of counterfactuals. In Groenendijk, J., and Stokhof, M., editors. Proceedings of the Amsterdam Colloquium on Montague Grammar and Related Topics. Amsterdam Papers in Formal Grammar, Vol. 1. Amsterdam: Centrale Interfaculteit, Universiteit van Amsterdam, pp. 248282.Google Scholar
Veltman, F. (1985). Logics for Conditionals. Ph.D. Thesis, University of Amsterdam.Google Scholar
Venema, Y. (1999). Points, lines and diamonds: A two-sorted modal logic for projective planes. Journal of Logic and Computation, 9(5), 601621.CrossRefGoogle Scholar
Zhu, Z. (2006). Similarity between preferential models. Theoretical Computer Science, 353(1), 2652.CrossRefGoogle Scholar