26 citations · 27 across the 4 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2018★ 1 cited
Reachability for infinite time Turing machines with long tapes
Merlin Carl, Benjamin Rin, Philipp Schlicht
Infinite time Turing machine models with tape length , denoted , strengthen the machines of Hamkins and Kidder [HL00] with tape length . A new phenomenon is that for som…
math.LO2015★ 26 cited
Realizability Semantics for Quantified Modal Logic: Generalizing Flagg's 1985 Construction
Benjamin G. Rin, Sean Walsh
A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal ve…