1 citations · 1 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.LO2021
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…
math.LO2021★ 1 cited
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…