22 citations · 22 across the 4 of their papers we have counts for
4 papers
Well-founded Boolean ultrapowers as large cardinal embeddings
Joel David Hamkins, Daniel Evan Seabold
Boolean ultrapowers extend the classical ultrapower construction to work with ultrafilters on any complete Boolean algebra, rather than only on a power set algebra. When they are w…
Infinite time computable model theory
Joel David Hamkins, Russell Miller, Daniel Seabold +1
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for st…
A Calculus of Inconsistency I: Sentential Logic
Dan Seabold, Stefan Waner, Steve Warner
We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to w…
Infinite time Turing machines with only one tape
Joel David Hamkins, Daniel Evan Seabold
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same…