Showing math.LOShow all
2 papers · 1 filter
math.LO2024
Recognizable Realizability
Merlin Carl
We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show th…
math.LO2014
A Note on the Decidability of the Necessity of Axioms
Merlin Carl
A typical kind of question in mathematical logic is that for the necessity of a certain axiom: Given a proof of some statement in some axiomatic system , one looks for minim…