POLYHEDRAL COMPLETENESS OF INTERMEDIATE LOGICS: THE NERVE CRITERION

DOI10.1017/JSL.2022.76MaRDI QIDQ6123585zbMATH OpenOpenAlexFDO

Authors Sam Adam-Day, Nick Bezhanishvili, David Gabelaia, Vincenzo Marra

Publication date 5 April 2024

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

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

zbMATH Keywords

\(p\)-morphismbarycentric subdivisiongeometric realisationgraded posetintermediate logicJankov-Fine formulamodal logicnervenerve criterionpolyhedral semanticspolyhedronrational polyhedronstarlike treetriangulation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Intermediate logics (03B55) Combinatorics of partially ordered sets (06A07) Heyting algebras (lattice-theoretic aspects) (06D20) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Abstract: We investigate a recently-devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral-completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov's notion of the nerve of a poset. It affords a purely combinatorial characterisation of polyhedrally-complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally-complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov-Fine formulas of 'starlike trees' all of which are polyhedrally-complete. The polyhedral completeness theorem for these 'starlike logics' is the second main result of this paper.

Cites work

• A Sufficient Condition for the Finite Model Property of Modal Logics above K4
• Advanced Łukasiewicz calculus and MV-algebras
• Algebraic postulates and a geometric interpretation for the Lewis calculus of strict implication
• AN ALGEBRAIC APPROACH TO CANONICAL FORMULAS: INTUITIONISTIC CASE
• Connected modal logics
• Euclidean hierarchy in modal logic
• Handbook of Spatial Logics
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 3666828 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 3235051 (Why is no real title available?)
• scientific article; zbMATH DE number 3326356 (Why is no real title available?)
• scientific article; zbMATH DE number 3401836 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• Locally finite reducts of Heyting algebras and canonical formulas
• On closed elements in closure algebras
• On Rational Subdivisions of Polyhedra with Rational Vertices
• Ordering by Divisibility in Abstract Algebras
• Reasoning About Space: The Modal Way
• Semi-Boolean algebras and their applications to intuitionistic logic with dual operations
• Tarski's theorem on intuitionistic logic, for polyhedra
• The algebra of topology
• Topological representations of distributive lattices and Brouwerian logics

Cited in

(1)

• Simplicial belief

This page was built for publication: POLYHEDRAL COMPLETENESS OF INTERMEDIATE LOGICS: THE NERVE CRITERION

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