1 citations · 1 across the 10 of their papers we have counts for
5 papers · 1 filter
The Intermediate Logic of Convex Polyhedra
Sam Adam-Day, Nick Bezhanishvili, David Gabelaia +1
We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of al…
Bisimulations of potentialist systems
Sam Adam-Day
A potentialist system is a first-order Kripke model based on embeddings. I define the notion of bisimulation for these systems, and provide a number of examples. Given a first-orde…
Uniform, rigid branchwise-real trees
Sam Adam-Day
A branchwise-real tree is a partial order which is a tree and in which every branch is isomorphic to a real interval. I give constructions of such trees which are both rigid (i.e.…
Polyhedral completeness of intermediate logics: the Nerve Criterion
Sam Adam-Day, Nick Bezhanishvili, David Gabelaia +1
We investigate a recently-devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally…
On the continuous gradability of the cut-point orders of -trees
Sam Adam-Day
An -tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders und…