7 citations · 8 across the 4 of their papers we have counts for
4 papers
On proving consistency of equational theories in Bounded Arithmetic
Arnold Beckmann, Yoriyuki Yamagata
We consider pure equational theories that allow substitution but disallow induction, which we denote as PETS, based on recursive definition of their function symbols. We show that…
Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control
Fahad F. Alhabardi, Arnold Beckmann, Bogdan Lazar +1
This paper contributes to the verification of programs written in Bitcoin's smart contract language SCRIPT in the interactive theorem prover Agda. It focuses on the security proper…
On the computational complexity of cut-reduction
Klaus Aehlig, Arnold Beckmann
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation sys…
Continuous Fraisse Conjecture
Arnold Beckmann, Martin Goldstern, Norbert Preining
We investigate the relation of countable closed subsets of the reals with respect to continuous monotone embeddability; we show that there are exactly aleph_1 many equivalence clas…